./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN --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 b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b --- 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-6b4ec56 [2022-11-20 10:37:07,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:37:07,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:37:07,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:37:07,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:37:07,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:37:07,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:37:07,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:37:07,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:37:07,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:37:07,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:37:07,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:37:07,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:37:07,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:37:07,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:37:07,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:37:07,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:37:07,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:37:07,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:37:07,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:37:07,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:37:07,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:37:07,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:37:07,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:37:07,349 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:37:07,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:37:07,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:37:07,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:37:07,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:37:07,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:37:07,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:37:07,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:37:07,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:37:07,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:37:07,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:37:07,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:37:07,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:37:07,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:37:07,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:37:07,370 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:37:07,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:37:07,372 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-20 10:37:07,420 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:37:07,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:37:07,422 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:37:07,422 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:37:07,423 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:37:07,423 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:37:07,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:37:07,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:37:07,425 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:37:07,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:37:07,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:37:07,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:37:07,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:37:07,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:37:07,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:37:07,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:37:07,428 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 10:37:07,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:37:07,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:37:07,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:37:07,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:37:07,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:37:07,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:37:07,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:37:07,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:37:07,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:37:07,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:37:07,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:37:07,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:37:07,432 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:37:07,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:37:07,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:37:07,433 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_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/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_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN 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 -> b459ef52e6f503a483dfcee5782d400696002c8f6100462cc05f5e2316fe0d4b [2022-11-20 10:37:07,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:37:07,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:37:07,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:37:07,840 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:37:07,840 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:37:07,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2022-11-20 10:37:11,227 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:37:11,499 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:37:11,500 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/sv-benchmarks/c/termination-memory-alloca/b.09-no-inv_assume-alloca.i [2022-11-20 10:37:11,512 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/data/e3744a92f/0e9a75ef115c4c289d78dbafe59f486d/FLAG350df233e [2022-11-20 10:37:11,530 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/data/e3744a92f/0e9a75ef115c4c289d78dbafe59f486d [2022-11-20 10:37:11,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:37:11,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:37:11,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:37:11,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:37:11,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:37:11,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3aa344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:11, skipping insertion in model container [2022-11-20 10:37:11,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:37:11" (1/1) ... [2022-11-20 10:37:11,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:37:11,609 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:37:11,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:37:11,926 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:37:11,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:37:11,998 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:37:12,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12 WrapperNode [2022-11-20 10:37:12,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:37:12,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:37:12,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:37:12,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:37:12,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,050 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-20 10:37:12,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:37:12,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:37:12,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:37:12,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:37:12,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,077 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:37:12,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:37:12,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:37:12,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:37:12,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (1/1) ... [2022-11-20 10:37:12,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:37:12,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:12,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:37:12,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:37:12,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:37:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:37:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:37:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:37:12,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:37:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:37:12,383 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:37:12,386 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:37:12,598 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:37:12,606 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:37:12,607 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:37:12,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:12 BoogieIcfgContainer [2022-11-20 10:37:12,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:37:12,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:37:12,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:37:12,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:37:12,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:37:11" (1/3) ... [2022-11-20 10:37:12,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ca5c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:37:12, skipping insertion in model container [2022-11-20 10:37:12,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:37:12" (2/3) ... [2022-11-20 10:37:12,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ca5c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:37:12, skipping insertion in model container [2022-11-20 10:37:12,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:37:12" (3/3) ... [2022-11-20 10:37:12,631 INFO L112 eAbstractionObserver]: Analyzing ICFG b.09-no-inv_assume-alloca.i [2022-11-20 10:37:12,654 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:37:12,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-20 10:37:12,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:37:12,737 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;@2f4c39ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:37:12,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 10:37:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:37:12,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:12,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:12,753 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-20 10:37:12,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:12,758 INFO L85 PathProgramCache]: Analyzing trace with hash 123263665, now seen corresponding path program 1 times [2022-11-20 10:37:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:12,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545816553] [2022-11-20 10:37:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:13,242 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-20 10:37:13,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:13,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545816553] [2022-11-20 10:37:13,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545816553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:13,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:13,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:37:13,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145661838] [2022-11-20 10:37:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:13,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:37:13,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:13,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:37:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:37:13,312 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.5625) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-20 10:37:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:13,375 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-20 10:37:13,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:37:13,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-20 10:37:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:13,391 INFO L225 Difference]: With dead ends: 39 [2022-11-20 10:37:13,392 INFO L226 Difference]: Without dead ends: 16 [2022-11-20 10:37:13,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:37:13,403 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:13,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:37:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-20 10:37:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-20 10:37:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-11-20 10:37:13,450 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2022-11-20 10:37:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:13,450 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-11-20 10:37:13,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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-20 10:37:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-11-20 10:37:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:37:13,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:13,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:13,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:37:13,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:37:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash 180521967, now seen corresponding path program 1 times [2022-11-20 10:37:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:13,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755836727] [2022-11-20 10:37:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:13,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,047 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-20 10:37:14,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:14,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755836727] [2022-11-20 10:37:14,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755836727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:14,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:14,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:37:14,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030196065] [2022-11-20 10:37:14,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:14,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:37:14,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:14,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:37:14,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:37:14,053 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-20 10:37:14,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:14,164 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-20 10:37:14,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:37:14,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-20 10:37:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:14,166 INFO L225 Difference]: With dead ends: 28 [2022-11-20 10:37:14,167 INFO L226 Difference]: Without dead ends: 27 [2022-11-20 10:37:14,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:14,169 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:14,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 25 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-20 10:37:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-11-20 10:37:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-11-20 10:37:14,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2022-11-20 10:37:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:14,188 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-11-20 10:37:14,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-20 10:37:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-11-20 10:37:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:37:14,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:14,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:14,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:37:14,190 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-20 10:37:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1301211949, now seen corresponding path program 1 times [2022-11-20 10:37:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:14,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935290598] [2022-11-20 10:37:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:14,666 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-20 10:37:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:14,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935290598] [2022-11-20 10:37:14,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935290598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:14,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:14,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:37:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637383334] [2022-11-20 10:37:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:14,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:37:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:37:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:37:14,681 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-20 10:37:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:14,824 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-11-20 10:37:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:37:14,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-20 10:37:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:14,826 INFO L225 Difference]: With dead ends: 27 [2022-11-20 10:37:14,826 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 10:37:14,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:37:14,828 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:14,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:14,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 10:37:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-11-20 10:37:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 23 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-20 10:37:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-11-20 10:37:14,843 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2022-11-20 10:37:14,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:14,845 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-11-20 10:37:14,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 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-20 10:37:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-11-20 10:37:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:37:14,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:14,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:14,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:37:14,847 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-20 10:37:14,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1301213743, now seen corresponding path program 1 times [2022-11-20 10:37:14,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:14,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423156120] [2022-11-20 10:37:14,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:15,011 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-20 10:37:15,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:15,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423156120] [2022-11-20 10:37:15,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423156120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:37:15,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:37:15,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:37:15,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341195709] [2022-11-20 10:37:15,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:37:15,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:37:15,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:37:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:37:15,015 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-20 10:37:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:15,083 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-11-20 10:37:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:37:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-20 10:37:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:15,084 INFO L225 Difference]: With dead ends: 25 [2022-11-20 10:37:15,084 INFO L226 Difference]: Without dead ends: 24 [2022-11-20 10:37:15,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:37:15,086 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:15,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:37:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-20 10:37:15,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-20 10:37:15,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:37:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-20 10:37:15,093 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 9 [2022-11-20 10:37:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:15,094 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-20 10:37:15,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-20 10:37:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-20 10:37:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 10:37:15,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:15,095 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:37:15,095 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:37:15,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1319823166, now seen corresponding path program 1 times [2022-11-20 10:37:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:15,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775746023] [2022-11-20 10:37:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:15,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775746023] [2022-11-20 10:37:15,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775746023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:15,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971254893] [2022-11-20 10:37:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:15,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:15,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:15,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:15,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:37:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:16,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 10:37:16,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:17,097 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-20 10:37:17,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 462 treesize of output 894 [2022-11-20 10:37:17,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:37:17,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 10:37:17,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:37:17,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:37:22,835 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 3508 treesize of output 2822 [2022-11-20 10:37:24,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:37:24,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:24,785 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 19 treesize of output 3 [2022-11-20 10:37:29,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:29,848 INFO L321 Elim1Store]: treesize reduction 71, result has 25.3 percent of original size [2022-11-20 10:37:29,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 4242 treesize of output 3866 [2022-11-20 10:37:31,201 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-20 10:37:31,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:31,229 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 16 treesize of output 14 [2022-11-20 10:37:31,276 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:37:31,344 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:37:31,348 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:37:31,557 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-20 10:37:32,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:33,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 5 [2022-11-20 10:37:33,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:33,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 5 [2022-11-20 10:37:33,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:33,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 5 [2022-11-20 10:37:33,413 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 346 treesize of output 338 [2022-11-20 10:37:33,579 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 640 treesize of output 626 [2022-11-20 10:37:33,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:34,208 INFO L321 Elim1Store]: treesize reduction 39, result has 40.9 percent of original size [2022-11-20 10:37:34,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 3325 treesize of output 2991 [2022-11-20 10:37:34,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 10:37:34,908 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-20 10:37:35,619 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-20 10:37:36,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:36,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:36,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:36,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:36,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 7 [2022-11-20 10:37:36,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:36,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:36,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:36,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 3 [2022-11-20 10:37:36,937 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-20 10:37:40,536 INFO L321 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2022-11-20 10:37:40,538 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 872 treesize of output 787 [2022-11-20 10:37:40,672 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 758 treesize of output 754 [2022-11-20 10:37:40,794 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 49 treesize of output 45 [2022-11-20 10:37:40,863 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 49 treesize of output 45 [2022-11-20 10:37:40,890 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-20 10:37:40,955 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 49 treesize of output 45 [2022-11-20 10:37:41,115 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-20 10:37:41,151 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 27 treesize of output 22 [2022-11-20 10:37:41,253 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 35 treesize of output 35 [2022-11-20 10:37:41,503 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-20 10:37:41,504 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 68 treesize of output 77 [2022-11-20 10:37:41,577 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-20 10:37:41,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:41,775 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 34 treesize of output 22 [2022-11-20 10:37:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:41,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:37:42,007 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_159))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-20 10:37:42,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_159))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) is different from false [2022-11-20 10:37:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 10:37:42,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971254893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:37:42,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:37:42,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-20 10:37:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403117794] [2022-11-20 10:37:42,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:37:42,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 10:37:42,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:37:42,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 10:37:42,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=305, Unknown=9, NotChecked=74, Total=462 [2022-11-20 10:37:42,303 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-20 10:37:42,812 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (let ((.cse3 (<= .cse1 2147483647)) (.cse17 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse14 (not .cse2))) (and (let ((.cse0 (<= .cse1 0))) (or (and (not .cse0) (not |c_ULTIMATE.start_test_fun_#t~short7#1|)) (and .cse0 |c_ULTIMATE.start_test_fun_#t~short7#1|))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or .cse2 .cse3) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select .cse19 0))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17)) (.cse13 (<= .cse5 0))) (or (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse7 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse4 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse8 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (and (= .cse4 .cse5) (= v_arrayElimArr_8 (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse4) 0 (select v_arrayElimArr_8 0))) (= v_DerPreprocessor_28 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (<= .cse9 2147483647) (= .cse9 .cse1) (= v_prenex_88 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse12 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select v_DerPreprocessor_30 0) .cse5) (= .cse10 .cse1) (= v_prenex_99 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_19 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (<= .cse10 2147483647) (= .cse6 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))) .cse2 .cse13) (and .cse14 (exists ((v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_57 (Array Int Int))) (let ((.cse18 (store (store (store (store (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_57) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (let ((.cse15 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_53) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19)) (.cse16 (select (select .cse18 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse6 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse16 .cse1) (= (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse17) (<= .cse16 2147483647))))) .cse13) (and (or (exists ((v_arrayElimArr_8 (Array Int Int)) (v_prenex_87 (Array Int Int)) (v_DerPreprocessor_28 (Array Int Int)) (v_DerPreprocessor_29 (Array Int Int)) (v_prenex_88 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8))) (let ((.cse25 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_88) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_87) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimArr_8)) (.cse21 (select v_arrayElimArr_8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse22 (select .cse25 0))) (and (= v_arrayElimArr_8 (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse21) 0 (select v_arrayElimArr_8 0))) (= .cse22 .cse5) (= v_DerPreprocessor_28 (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse6 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (<= .cse22 0) (= v_prenex_88 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse21 .cse22)))))) (exists ((v_DerPreprocessor_30 (Array Int Int)) (v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_prenex_100 (Array Int Int)) (v_prenex_99 (Array Int Int)) (v_DerPreprocessor_42 Int) (v_DerPreprocessor_41 Int)) (let ((.cse27 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_99) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_100) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (let ((.cse26 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse29 (select .cse26 0)) (.cse28 (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_41) 0 v_DerPreprocessor_42) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse30 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_19) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_30))) (and (= (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (= v_prenex_99 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse28 .cse29) (= v_DerPreprocessor_19 (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse29 (select v_DerPreprocessor_30 0)) (= .cse29 .cse5) (<= .cse29 0) (= v_DerPreprocessor_41 .cse28) (= .cse6 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) .cse2) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) .cse13) (let ((.cse31 (select .cse17 0))) (and (<= .cse31 0) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (let ((.cse32 (store (store (store (store (store .cse20 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| .cse17) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (let ((.cse33 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse32 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (and (= .cse17 (select .cse32 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse6 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse17 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) .cse14 (= .cse5 .cse31) (= (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1))) (and (or (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3 .cse13) (and (exists ((v_DerPreprocessor_39 Int) (v_DerPreprocessor_40 Int)) (let ((.cse34 (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_39) 0 v_DerPreprocessor_40) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= .cse34 0) (= .cse34 .cse5) (= .cse34 v_DerPreprocessor_39)))) (exists ((v_DerPreprocessor_50 (Array Int Int)) (v_DerPreprocessor_49 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse38 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse35 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse36 (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_49) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse19))) (and (= .cse35 .cse1) (<= .cse35 2147483647) (= .cse6 (select .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse17 (select .cse36 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse37 .cse17)))))))) .cse14))))) (or (and (= (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) .cse14) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))))) is different from true [2022-11-20 10:37:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:37:44,453 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-20 10:37:44,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:37:44,453 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-20 10:37:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:37:44,455 INFO L225 Difference]: With dead ends: 46 [2022-11-20 10:37:44,455 INFO L226 Difference]: Without dead ends: 45 [2022-11-20 10:37:44,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=165, Invalid=583, Unknown=20, NotChecked=162, Total=930 [2022-11-20 10:37:44,457 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:37:44,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 82 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 126 Unchecked, 0.1s Time] [2022-11-20 10:37:44,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-20 10:37:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-11-20 10:37:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.303030303030303) internal successors, (43), 36 states have internal predecessors, (43), 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-20 10:37:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-11-20 10:37:44,466 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 14 [2022-11-20 10:37:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:37:44,466 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-11-20 10:37:44,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 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-20 10:37:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-11-20 10:37:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:37:44,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:37:44,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:37:44,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:37:44,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:44,676 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:37:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:37:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2035156546, now seen corresponding path program 1 times [2022-11-20 10:37:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:37:44,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325355813] [2022-11-20 10:37:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:37:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:37:45,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:37:45,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325355813] [2022-11-20 10:37:45,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325355813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:37:45,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605326291] [2022-11-20 10:37:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:37:45,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:37:45,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:37:45,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:37:45,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:37:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:37:45,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-20 10:37:45,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:37:46,195 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-20 10:37:46,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-11-20 10:37:46,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 10:37:46,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:37:46,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:37:46,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:37:51,734 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 2269 treesize of output 2164 [2022-11-20 10:37:53,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:53,377 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 27 treesize of output 5 [2022-11-20 10:37:53,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:53,895 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 27 treesize of output 5 [2022-11-20 10:37:54,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:54,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:54,168 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:37:54,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 755 treesize of output 692 [2022-11-20 10:37:54,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:54,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:54,794 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:37:54,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 651 treesize of output 556 [2022-11-20 10:37:54,811 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 519 treesize of output 517 [2022-11-20 10:37:54,825 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 517 treesize of output 515 [2022-11-20 10:37:54,852 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 515 treesize of output 513 [2022-11-20 10:37:55,938 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 27 treesize of output 25 [2022-11-20 10:37:56,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:56,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:56,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:37:56,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 28 [2022-11-20 10:37:56,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:56,832 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-20 10:37:56,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:56,969 INFO L321 Elim1Store]: treesize reduction 38, result has 47.2 percent of original size [2022-11-20 10:37:56,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 665 treesize of output 746 [2022-11-20 10:37:57,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:57,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:57,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:37:58,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,237 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-20 10:37:58,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 33 [2022-11-20 10:37:58,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 12 [2022-11-20 10:38:05,361 INFO L321 Elim1Store]: treesize reduction 46, result has 37.0 percent of original size [2022-11-20 10:38:05,363 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 3774 treesize of output 3371 [2022-11-20 10:38:06,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:06,192 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 12 treesize of output 10 [2022-11-20 10:38:06,257 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 24 treesize of output 21 [2022-11-20 10:38:06,269 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2022-11-20 10:38:06,621 INFO L321 Elim1Store]: treesize reduction 20, result has 63.6 percent of original size [2022-11-20 10:38:06,622 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 55 treesize of output 76 [2022-11-20 10:38:06,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:38:06,699 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-20 10:38:06,787 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 10:38:07,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 32 [2022-11-20 10:38:07,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-11-20 10:38:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:07,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:38:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:08,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605326291] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:38:08,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:38:08,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2022-11-20 10:38:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927272042] [2022-11-20 10:38:08,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:08,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 10:38:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:38:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 10:38:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=550, Unknown=12, NotChecked=0, Total=702 [2022-11-20 10:38:08,560 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 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-20 10:38:08,851 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (not .cse19)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse0 (not .cse1) (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse10 (= .cse18 0))) (or (and .cse2 (or (and (exists ((v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_502 (Array Int Int))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7))) (let ((.cse5 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse6 (select (store (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_prenex_502 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= .cse6 v_DerPreprocessor_107) (= .cse6 0)))))) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_380 (Array Int Int)) (v_prenex_379 (Array Int Int))) (let ((.cse8 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45))) (and (= (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_379) (= (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse9) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0)))) .cse10) (and (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_506 (Array Int Int)) (v_prenex_507 (Array Int Int)) (v_prenex_502 (Array Int Int))) (let ((.cse13 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse12 (select (store (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse11 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7))) (and (= v_prenex_502 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse12 v_DerPreprocessor_107) (= .cse12 0) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse13 .cse14) (= .cse13 (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse13 v_prenex_506))))) .cse10) (and .cse0 .cse10) (let ((.cse15 (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse15 0) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_506 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_prenex_507 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse17 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_97) (= .cse7 (store (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse15) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse18)) (= .cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse17 .cse14) (= .cse17 v_prenex_506)))))))) (and .cse19 .cse10 (or (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse20 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse20 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse21 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse14 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse20) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse22 v_prenex_453))))) (exists ((v_prenex_514 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse26 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse25 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_514) (= v_DerPreprocessor_101 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (and (exists ((v_prenex_459 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_457 (Array Int Int)) (v_prenex_458 (Array Int Int))) (let ((.cse27 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459)) (.cse28 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459))) (and (= v_DerPreprocessor_83 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= (select v_prenex_459 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_458)))) (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_prenex_377 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_378 (Array Int Int)) (v_prenex_511 (Array Int Int)) (v_prenex_512 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse30 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse29 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (= .cse14 (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= v_DerPreprocessor_110 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_prenex_378 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_511)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse33 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse32 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse38 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse34 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse32 0) (= v_DerPreprocessor_110 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse37 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse35 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse36 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse14 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_prenex_456 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_455) (= v_prenex_516 .cse36) (= .cse14 (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse32) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= v_prenex_376 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse39 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse39 0) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse40 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse41 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_514 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse47 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse46 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse44 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse45 (select .cse46 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse42 .cse43) (= .cse14 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse42 v_prenex_455) (= v_prenex_516 .cse45) (= .cse14 (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse39) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= .cse14 (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse43 v_prenex_514))))) (= .cse14 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse41 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse48 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse54 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse7)) (.cse53 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse48 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse51 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse49 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse50 (select .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse14 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse48) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse14) (= (select .cse49 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse50 v_prenex_453))))) (= v_DerPreprocessor_110 (select .cse52 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_376 (select .cse54 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse14 (select .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) (and .cse1 .cse10))))) .cse2 (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_230 Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_230)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_230 .cse4))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2022-11-20 10:38:09,537 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse1 (select .cse10 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse4 (not .cse19))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse0 (<= .cse1 |c_ULTIMATE.start_test_fun_#t~mem10#1|) (not .cse2) (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (let ((.cse11 (= .cse18 0))) (or (and .cse4 (or (and (exists ((v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_502 (Array Int Int))) (let ((.cse5 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse7 (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= v_prenex_502 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (= .cse7 v_DerPreprocessor_107) (= .cse7 0)))))) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_380 (Array Int Int)) (v_prenex_379 (Array Int Int))) (let ((.cse9 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_379) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_380) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45))) (and (= (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_prenex_379) (= (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse10) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0)))) .cse11) (and (exists ((v_arrayElimCell_45 (Array Int Int)) (v_prenex_503 (Array Int Int)) (v_DerPreprocessor_107 Int) (v_DerPreprocessor_108 Int) (v_prenex_506 (Array Int Int)) (v_prenex_507 (Array Int Int)) (v_prenex_502 (Array Int Int))) (let ((.cse14 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse13 (select (store (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_DerPreprocessor_107) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_DerPreprocessor_108) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse12 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_502) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_503) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (and (= v_prenex_502 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse13 v_DerPreprocessor_107) (= .cse13 0) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse14 .cse3) (= .cse14 (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse14 v_prenex_506))))) .cse11) (and .cse0 .cse11) (let ((.cse15 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse15 0) (exists ((v_arrayElimCell_45 (Array Int Int)) (v_DerPreprocessor_97 (Array Int Int)) (v_prenex_506 (Array Int Int)) (v_DerPreprocessor_98 (Array Int Int)) (v_prenex_507 (Array Int Int))) (let ((.cse16 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_97) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_98) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse17 (select (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_506) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_507) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_arrayElimCell_45) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse16 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_97) (= .cse8 (store (store .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse15) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse18)) (= .cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= (select v_arrayElimCell_45 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse17 .cse3) (= .cse17 v_prenex_506)))))))) (and .cse19 .cse11 (or (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse20 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse20 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse23 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse21 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse3 (select .cse21 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse22 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse20) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse23 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= (select .cse21 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse22 v_prenex_453))))) (exists ((v_prenex_514 (Array Int Int)) (v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse24 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse26 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse25 (store (store (store (store (store (store .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse25 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse26 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse24 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_514) (= v_DerPreprocessor_101 (select .cse25 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (and (exists ((v_prenex_459 (Array Int Int)) (v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int)) (v_prenex_457 (Array Int Int)) (v_prenex_458 (Array Int Int))) (let ((.cse27 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459)) (.cse28 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_457) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_458) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_459))) (and (= v_DerPreprocessor_83 (select .cse27 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse27 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse28 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= (select v_prenex_459 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse28 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_458)))) (exists ((v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_prenex_377 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int)) (v_prenex_378 (Array Int Int)) (v_prenex_511 (Array Int Int)) (v_prenex_512 (Array Int Int))) (let ((.cse31 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse30 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_377) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse29 (store (store (store (store (store (store .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_512) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_511) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 0) (= .cse3 (select .cse29 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= v_DerPreprocessor_110 (select .cse31 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_prenex_378 (select .cse30 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse31 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select .cse29 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_511)))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse33 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse32 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse38 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse34 (store (store (store (store (store (store .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse32 0) (= v_DerPreprocessor_110 (select .cse33 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse34 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse37 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse35 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse36 (select .cse37 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse3 (select .cse35 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_prenex_456 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= (select .cse35 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_455) (= v_prenex_516 .cse36) (= .cse3 (select .cse37 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse36 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse32) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= v_prenex_376 (select .cse38 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse38 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse33 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse34 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))) (exists ((v_DerPreprocessor_111 (Array Int Int))) (let ((.cse39 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (= .cse39 0) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse40 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse41 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= v_DerPreprocessor_110 (select .cse40 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse41 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (exists ((v_prenex_514 (Array Int Int)) (v_prenex_513 (Array Int Int))) (let ((.cse47 (store (store (store (store (store (store .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_513) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_514) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_515 (Array Int Int)) (v_prenex_516 (Array Int Int)) (v_prenex_454 (Array Int Int)) (v_prenex_455 (Array Int Int)) (v_prenex_456 (Array Int Int))) (let ((.cse46 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_515) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_516) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456)) (.cse44 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_454) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_455) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_456))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse45 (select .cse46 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse42 .cse43) (= .cse3 (select .cse44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse42 v_prenex_455) (= v_prenex_516 .cse45) (= .cse3 (select .cse46 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_111 (store (store .cse45 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse39) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))))))) (= .cse3 (select .cse47 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse43 v_prenex_514))))) (= .cse3 (select .cse40 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse41 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))))))))) (exists ((v_DerPreprocessor_101 (Array Int Int)) (v_DerPreprocessor_110 (Array Int Int)) (v_DerPreprocessor_111 (Array Int Int)) (v_DerPreprocessor_100 (Array Int Int)) (v_prenex_375 (Array Int Int)) (v_prenex_376 (Array Int Int)) (v_DerPreprocessor_109 (Array Int Int))) (let ((.cse52 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_109) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_110) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (let ((.cse48 (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse54 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_375) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_376) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8)) (.cse53 (store (store (store (store (store (store .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_100) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_101) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_111))) (and (= .cse48 0) (exists ((v_prenex_449 (Array Int Int)) (v_prenex_450 (Array Int Int)) (v_prenex_451 (Array Int Int)) (v_prenex_452 (Array Int Int)) (v_prenex_453 (Array Int Int))) (let ((.cse51 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_452) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_453) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451))) (let ((.cse49 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_449) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_450) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_451)) (.cse50 (select .cse51 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (select v_prenex_451 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (= .cse3 (select .cse49 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (store .cse50 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse48) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (select v_DerPreprocessor_111 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_DerPreprocessor_111) (= (select .cse51 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse3) (= (select .cse49 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) v_prenex_450) (= .cse50 v_prenex_453))))) (= v_DerPreprocessor_110 (select .cse52 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse53 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_prenex_376 (select .cse54 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse3 (select .cse54 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse3 (select .cse52 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= v_DerPreprocessor_101 (select .cse53 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)))))))) (and .cse2 .cse11))))) .cse4 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2022-11-20 10:38:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:10,384 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-11-20 10:38:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:38:10,385 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 10:38:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:10,386 INFO L225 Difference]: With dead ends: 76 [2022-11-20 10:38:10,386 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 10:38:10,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=350, Invalid=1204, Unknown=14, NotChecked=154, Total=1722 [2022-11-20 10:38:10,389 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:10,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 159 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 70 Unchecked, 0.2s Time] [2022-11-20 10:38:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 10:38:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2022-11-20 10:38:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-11-20 10:38:10,406 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 15 [2022-11-20 10:38:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:10,408 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-11-20 10:38:10,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 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-20 10:38:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-11-20 10:38:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:38:10,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:10,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:38:10,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:10,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:10,620 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:38:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -2035154752, now seen corresponding path program 1 times [2022-11-20 10:38:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:38:10,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431838304] [2022-11-20 10:38:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:38:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:10,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:10,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:38:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431838304] [2022-11-20 10:38:10,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431838304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:38:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665825030] [2022-11-20 10:38:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:10,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:10,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:38:10,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:38:10,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:38:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:11,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 10:38:11,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:11,250 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:38:11,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:38:11,272 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-20 10:38:11,292 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-20 10:38:11,308 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-20 10:38:11,643 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:38:11,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 197 [2022-11-20 10:38:11,710 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-20 10:38:11,736 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-20 10:38:11,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:38:11,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:38:11,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:11,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:11,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 23 [2022-11-20 10:38:11,937 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-20 10:38:11,942 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-20 10:38:13,467 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-20 10:38:13,467 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 820 treesize of output 785 [2022-11-20 10:38:13,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:38:13,699 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-20 10:38:13,748 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-20 10:38:13,774 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-20 10:38:13,816 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:38:13,823 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-20 10:38:13,843 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 18 treesize of output 15 [2022-11-20 10:38:13,865 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 18 treesize of output 15 [2022-11-20 10:38:14,048 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-20 10:38:14,048 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 10:38:14,313 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-20 10:38:14,314 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 61 treesize of output 72 [2022-11-20 10:38:14,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:14,363 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 49 treesize of output 51 [2022-11-20 10:38:14,453 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-20 10:38:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:14,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:38:14,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_293 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-20 10:38:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:14,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665825030] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:38:14,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:38:14,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2022-11-20 10:38:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985549333] [2022-11-20 10:38:14,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:14,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:38:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:38:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:38:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=409, Unknown=6, NotChecked=42, Total=552 [2022-11-20 10:38:14,850 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 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-20 10:38:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:16,095 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-11-20 10:38:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:38:16,096 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 10:38:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:16,097 INFO L225 Difference]: With dead ends: 48 [2022-11-20 10:38:16,097 INFO L226 Difference]: Without dead ends: 47 [2022-11-20 10:38:16,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=157, Invalid=704, Unknown=13, NotChecked=56, Total=930 [2022-11-20 10:38:16,101 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:16,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 92 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-11-20 10:38:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-20 10:38:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-11-20 10:38:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 45 states have internal predecessors, (55), 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-20 10:38:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-11-20 10:38:16,110 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 15 [2022-11-20 10:38:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:16,111 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-11-20 10:38:16,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 24 states have internal predecessors, (41), 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-20 10:38:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-11-20 10:38:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 10:38:16,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:16,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:38:16,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:16,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:16,313 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-20 10:38:16,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1820880262, now seen corresponding path program 1 times [2022-11-20 10:38:16,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:38:16,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383878451] [2022-11-20 10:38:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:38:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:16,593 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-20 10:38:16,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:38:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383878451] [2022-11-20 10:38:16,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383878451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:38:16,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63586909] [2022-11-20 10:38:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:16,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:38:16,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:38:16,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:38:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:16,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 10:38:16,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:17,506 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-20 10:38:17,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 226 treesize of output 790 [2022-11-20 10:38:17,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:38:17,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:38:17,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 10:38:17,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:38:22,058 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 2189 treesize of output 1871 [2022-11-20 10:38:23,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:38:24,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:38:24,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 13 treesize of output 9 [2022-11-20 10:38:24,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:24,454 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 45 treesize of output 29 [2022-11-20 10:38:24,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:24,551 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 19 treesize of output 3 [2022-11-20 10:38:24,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:24,713 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 41 treesize of output 25 [2022-11-20 10:38:24,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:24,745 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 19 treesize of output 3 [2022-11-20 10:38:24,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 281 [2022-11-20 10:38:25,024 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-20 10:38:25,076 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-20 10:38:25,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:25,157 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 23 treesize of output 1 [2022-11-20 10:38:26,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:38:26,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:38:26,118 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:38:26,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 464 treesize of output 409 [2022-11-20 10:38:26,128 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-20 10:38:26,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,325 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 64 treesize of output 57 [2022-11-20 10:38:26,348 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-20 10:38:26,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,639 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:38:26,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 878 treesize of output 801 [2022-11-20 10:38:26,795 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-20 10:38:26,849 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-20 10:38:26,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:26,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 335 treesize of output 296 [2022-11-20 10:38:27,010 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:38:27,017 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:38:27,023 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:38:27,030 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:38:28,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 25 [2022-11-20 10:38:28,928 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-20 10:38:49,236 INFO L321 Elim1Store]: treesize reduction 42, result has 39.1 percent of original size [2022-11-20 10:38:49,237 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 501 treesize of output 454 [2022-11-20 10:38:49,301 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2022-11-20 10:38:49,310 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 57 treesize of output 53 [2022-11-20 10:38:49,454 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 62 [2022-11-20 10:38:49,462 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 57 treesize of output 53 [2022-11-20 10:38:49,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-20 10:38:49,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:49,687 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 32 treesize of output 27 [2022-11-20 10:38:49,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:49,715 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-11-20 10:38:49,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:38:49,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-20 10:38:50,184 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-20 10:38:50,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 86 [2022-11-20 10:38:50,190 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 84 treesize of output 80 [2022-11-20 10:38:50,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:50,572 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 60 treesize of output 36 [2022-11-20 10:38:50,594 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-20 10:38:50,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:38:50,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_358 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-20 10:38:50,886 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (not (<= (+ v_ArrVal_356 1) |c_ULTIMATE.start_test_fun_#t~mem12#1|)))))) is different from false [2022-11-20 10:38:50,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 Int) (v_ArrVal_358 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_356)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_358))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0) (< 2147483647 v_ArrVal_356))))) is different from false [2022-11-20 10:38:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 10:38:51,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63586909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:38:51,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:38:51,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-11-20 10:38:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921371078] [2022-11-20 10:38:51,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:51,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 10:38:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:38:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 10:38:51,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=409, Unknown=15, NotChecked=138, Total=702 [2022-11-20 10:38:51,255 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:38:57,347 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-11-20 10:38:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:38:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 10:38:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:38:57,348 INFO L225 Difference]: With dead ends: 51 [2022-11-20 10:38:57,348 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 10:38:57,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=213, Invalid=580, Unknown=31, NotChecked=168, Total=992 [2022-11-20 10:38:57,350 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:38:57,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 96 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-11-20 10:38:57,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 10:38:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 10:38:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-11-20 10:38:57,363 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 16 [2022-11-20 10:38:57,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:38:57,364 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-11-20 10:38:57,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:38:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-11-20 10:38:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:38:57,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:38:57,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:38:57,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:57,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-20 10:38:57,566 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:38:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:57,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1573594942, now seen corresponding path program 1 times [2022-11-20 10:38:57,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:38:57,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908688166] [2022-11-20 10:38:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:57,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:38:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:57,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:57,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:38:57,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908688166] [2022-11-20 10:38:57,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908688166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:38:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595710899] [2022-11-20 10:38:57,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:57,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:57,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:38:57,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:38:57,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:38:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:58,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 10:38:58,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:58,206 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:38:58,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:38:58,225 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-20 10:38:58,245 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-20 10:38:58,265 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-20 10:38:58,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:58,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:58,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:58,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2022-11-20 10:38:58,360 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-20 10:38:58,433 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:58,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:58,462 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-20 10:38:58,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 96 [2022-11-20 10:38:58,499 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-20 10:38:58,518 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-20 10:38:58,627 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:38:58,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2022-11-20 10:38:58,639 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-20 10:38:59,453 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-11-20 10:38:59,453 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 422 treesize of output 405 [2022-11-20 10:38:59,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:38:59,624 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-20 10:38:59,644 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-20 10:38:59,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:38:59,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:38:59,866 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-20 10:38:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:59,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:38:59,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-20 10:38:59,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_425 Int)) (or (not (<= v_ArrVal_425 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-20 10:38:59,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-20 10:38:59,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_423))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425))))) is different from false [2022-11-20 10:39:00,014 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_426 (Array Int Int)) (v_ArrVal_423 (Array Int Int)) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_423))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_425))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-20 10:39:00,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 10:39:00,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595710899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:00,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:00,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-11-20 10:39:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436272504] [2022-11-20 10:39:00,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:00,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 10:39:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 10:39:00,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=202, Unknown=8, NotChecked=170, Total=462 [2022-11-20 10:39:00,033 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:00,775 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-11-20 10:39:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:39:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 10:39:00,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:00,783 INFO L225 Difference]: With dead ends: 55 [2022-11-20 10:39:00,783 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 10:39:00,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=20, NotChecked=230, Total=756 [2022-11-20 10:39:00,784 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:00,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-11-20 10:39:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 10:39:00,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-11-20 10:39:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 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-20 10:39:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-11-20 10:39:00,798 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 17 [2022-11-20 10:39:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:00,798 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-11-20 10:39:00,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-11-20 10:39:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:39:00,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:00,800 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:00,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 10:39:01,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:01,001 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:39:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -612715006, now seen corresponding path program 2 times [2022-11-20 10:39:01,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:01,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794535175] [2022-11-20 10:39:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:01,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:01,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794535175] [2022-11-20 10:39:01,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794535175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:01,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529980767] [2022-11-20 10:39:01,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:39:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:01,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:01,301 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:01,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:39:01,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:39:01,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:39:01,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-20 10:39:01,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:01,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 10:39:01,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:01,603 INFO L321 Elim1Store]: treesize reduction 78, result has 48.0 percent of original size [2022-11-20 10:39:01,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 234 treesize of output 289 [2022-11-20 10:39:01,623 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-20 10:39:01,645 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-20 10:39:01,694 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-20 10:39:01,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:01,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:01,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 86 [2022-11-20 10:39:01,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:01,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:01,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2022-11-20 10:39:01,898 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:39:01,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 86 [2022-11-20 10:39:02,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 183 [2022-11-20 10:39:02,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:02,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:02,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-20 10:39:02,532 INFO L321 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2022-11-20 10:39:02,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 40 [2022-11-20 10:39:02,661 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-20 10:39:02,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 39 [2022-11-20 10:39:02,740 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 10:39:02,741 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 35 treesize of output 19 [2022-11-20 10:39:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:02,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:03,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529980767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:03,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:03,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2022-11-20 10:39:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333873167] [2022-11-20 10:39:03,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:03,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:39:03,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:03,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:39:03,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=502, Unknown=13, NotChecked=0, Total=600 [2022-11-20 10:39:03,362 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 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-20 10:39:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:03,966 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-11-20 10:39:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:39:03,967 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 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) Word has length 17 [2022-11-20 10:39:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:03,968 INFO L225 Difference]: With dead ends: 71 [2022-11-20 10:39:03,968 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 10:39:03,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=1034, Unknown=13, NotChecked=0, Total=1260 [2022-11-20 10:39:03,970 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:03,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 78 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 158 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2022-11-20 10:39:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 10:39:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-11-20 10:39:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-11-20 10:39:03,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 17 [2022-11-20 10:39:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:03,983 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-11-20 10:39:03,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) internal successors, (47), 25 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-20 10:39:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-11-20 10:39:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:39:03,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:03,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:03,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:04,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 10:39:04,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:39:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash -612713212, now seen corresponding path program 1 times [2022-11-20 10:39:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886557994] [2022-11-20 10:39:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886557994] [2022-11-20 10:39:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886557994] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757648073] [2022-11-20 10:39:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:04,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:04,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:04,527 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:04,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:39:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:04,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 10:39:04,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:04,832 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:39:04,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:39:04,849 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-20 10:39:04,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:39:04,883 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-20 10:39:05,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:39:05,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 30 [2022-11-20 10:39:05,459 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 23 treesize of output 21 [2022-11-20 10:39:05,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:05,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:05,517 INFO L321 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-11-20 10:39:05,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 165 [2022-11-20 10:39:05,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:05,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 11 [2022-11-20 10:39:05,935 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-20 10:39:05,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2022-11-20 10:39:05,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 10:39:06,030 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-20 10:39:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:06,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:06,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-20 10:39:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:06,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757648073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:06,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:06,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2022-11-20 10:39:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383626147] [2022-11-20 10:39:06,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 10:39:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 10:39:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=373, Unknown=7, NotChecked=42, Total=552 [2022-11-20 10:39:06,365 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 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-20 10:39:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:06,578 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-11-20 10:39:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 10:39:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 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) Word has length 17 [2022-11-20 10:39:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:06,582 INFO L225 Difference]: With dead ends: 58 [2022-11-20 10:39:06,583 INFO L226 Difference]: Without dead ends: 57 [2022-11-20 10:39:06,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=161, Invalid=486, Unknown=7, NotChecked=48, Total=702 [2022-11-20 10:39:06,584 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:06,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 82 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2022-11-20 10:39:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-20 10:39:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-11-20 10:39:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-11-20 10:39:06,609 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 17 [2022-11-20 10:39:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:06,610 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-11-20 10:39:06,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 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-20 10:39:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-11-20 10:39:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 10:39:06,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:06,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:06,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:06,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 10:39:06,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:39:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1536802878, now seen corresponding path program 1 times [2022-11-20 10:39:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:06,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334869469] [2022-11-20 10:39:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:07,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334869469] [2022-11-20 10:39:07,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334869469] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:07,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211338401] [2022-11-20 10:39:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:07,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:07,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:07,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:07,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:39:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:07,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 10:39:07,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:07,452 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:39:07,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:39:07,469 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-20 10:39:07,488 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-20 10:39:07,505 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-20 10:39:07,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,597 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-20 10:39:07,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 112 [2022-11-20 10:39:07,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 10:39:07,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 92 [2022-11-20 10:39:07,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 10:39:07,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 9 [2022-11-20 10:39:07,781 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-20 10:39:07,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:07,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 20 [2022-11-20 10:39:07,845 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-20 10:39:08,589 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-20 10:39:08,589 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 773 treesize of output 753 [2022-11-20 10:39:08,849 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-20 10:39:08,856 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-20 10:39:08,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:39:08,933 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 7 [2022-11-20 10:39:08,942 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 7 [2022-11-20 10:39:08,960 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-20 10:39:09,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:39:09,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:39:09,234 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 17 treesize of output 9 [2022-11-20 10:39:09,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:09,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:39:09,339 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_626) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)))) is different from false [2022-11-20 10:39:09,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:39:09,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-20 10:39:09,368 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 35 treesize of output 27 [2022-11-20 10:39:09,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:39:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 10:39:09,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211338401] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:09,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:09,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-11-20 10:39:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915032486] [2022-11-20 10:39:09,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:09,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:39:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:09,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:39:09,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=423, Unknown=32, NotChecked=44, Total=600 [2022-11-20 10:39:09,612 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:39:10,546 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2022-11-20 10:39:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:39:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 10:39:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:39:10,548 INFO L225 Difference]: With dead ends: 65 [2022-11-20 10:39:10,548 INFO L226 Difference]: Without dead ends: 64 [2022-11-20 10:39:10,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=224, Invalid=908, Unknown=62, NotChecked=66, Total=1260 [2022-11-20 10:39:10,550 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:39:10,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 109 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 93 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-11-20 10:39:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-20 10:39:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-11-20 10:39:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 56 states have internal predecessors, (66), 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-20 10:39:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2022-11-20 10:39:10,579 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 18 [2022-11-20 10:39:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:39:10,581 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2022-11-20 10:39:10,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:39:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2022-11-20 10:39:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 10:39:10,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:39:10,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:39:10,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:39:10,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:10,797 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:39:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:39:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2081214775, now seen corresponding path program 1 times [2022-11-20 10:39:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:39:10,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095004575] [2022-11-20 10:39:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:10,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:39:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:39:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:39:11,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095004575] [2022-11-20 10:39:11,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095004575] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:39:11,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834679926] [2022-11-20 10:39:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:39:11,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:39:11,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:39:11,111 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:39:11,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 10:39:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:39:11,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 10:39:11,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:39:12,035 INFO L321 Elim1Store]: treesize reduction 252, result has 37.8 percent of original size [2022-11-20 10:39:12,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 462 treesize of output 894 [2022-11-20 10:39:12,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2022-11-20 10:39:12,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 10:39:12,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:39:12,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-11-20 10:39:12,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:12,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:12,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:12,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:12,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:12,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:12,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:12,651 INFO L217 Elim1Store]: Index analysis took 110 ms [2022-11-20 10:39:12,695 INFO L321 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2022-11-20 10:39:12,696 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 2 new quantified variables, introduced 11 case distinctions, treesize of input 227 treesize of output 694 [2022-11-20 10:39:13,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,246 INFO L217 Elim1Store]: Index analysis took 253 ms [2022-11-20 10:39:13,314 INFO L321 Elim1Store]: treesize reduction 61, result has 11.6 percent of original size [2022-11-20 10:39:13,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 229 treesize of output 694 [2022-11-20 10:39:13,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:13,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 648 [2022-11-20 10:39:16,702 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 2326 treesize of output 1990 [2022-11-20 10:39:18,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:18,088 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 29 treesize of output 7 [2022-11-20 10:39:18,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:18,221 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 29 treesize of output 7 [2022-11-20 10:39:18,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:18,374 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 29 treesize of output 7 [2022-11-20 10:39:19,001 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-20 10:39:19,146 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 534 treesize of output 528 [2022-11-20 10:39:23,654 INFO L321 Elim1Store]: treesize reduction 366, result has 29.2 percent of original size [2022-11-20 10:39:23,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 11 new quantified variables, introduced 35 case distinctions, treesize of input 6697 treesize of output 8643 [2022-11-20 10:39:25,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:25,483 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-20 10:39:25,957 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-20 10:39:26,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:39:26,224 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-20 10:39:26,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 7 treesize of output 5 [2022-11-20 10:39:26,726 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:39:26,997 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 45 treesize of output 41 [2022-11-20 10:39:27,587 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 45 treesize of output 41 [2022-11-20 10:39:28,064 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-20 10:39:28,117 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-20 10:39:28,426 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-20 10:39:28,540 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 45 treesize of output 41 [2022-11-20 10:39:44,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 10:39:45,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 10:39:45,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 10:39:46,048 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 360 treesize of output 354 [2022-11-20 10:39:46,380 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-11-20 10:39:46,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 743 treesize of output 735 [2022-11-20 10:40:12,337 WARN L233 SmtUtils]: Spent 9.45s on a formula simplification. DAG size of input: 252 DAG size of output: 170 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-20 10:40:12,339 INFO L321 Elim1Store]: treesize reduction 740, result has 50.6 percent of original size [2022-11-20 10:40:12,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 12 new quantified variables, introduced 39 case distinctions, treesize of input 14762 treesize of output 19079 [2022-11-20 10:44:37,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:38,173 INFO L321 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-11-20 10:44:38,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3168 treesize of output 2447 [2022-11-20 10:44:42,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:42,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:42,312 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:44:42,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2799 treesize of output 27 [2022-11-20 10:44:42,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:42,320 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 29 treesize of output 7 [2022-11-20 10:44:42,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:42,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:42,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:42,610 INFO L321 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2022-11-20 10:44:42,611 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 3563 treesize of output 1232 [2022-11-20 10:44:42,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:44,270 INFO L321 Elim1Store]: treesize reduction 38, result has 87.8 percent of original size [2022-11-20 10:44:44,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 16338 treesize of output 6501 [2022-11-20 10:44:49,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:49,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:44:49,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 954 treesize of output 77 [2022-11-20 10:44:55,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:55,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:55,423 INFO L321 Elim1Store]: treesize reduction 614, result has 0.2 percent of original size [2022-11-20 10:44:55,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 9811 treesize of output 876 [2022-11-20 10:44:56,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:56,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:44:56,775 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-20 10:44:56,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 2095 treesize of output 1397 [2022-11-20 10:45:01,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:01,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:01,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 3486 treesize of output 3005 [2022-11-20 10:45:07,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:07,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:07,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3479 treesize of output 23 [2022-11-20 10:45:07,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:07,246 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 29 treesize of output 7 [2022-11-20 10:45:07,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:07,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:07,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:07,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:07,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 732 treesize of output 365 [2022-11-20 10:45:35,416 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-20 10:45:35,417 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 2795 treesize of output 2496 [2022-11-20 10:45:35,774 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-20 10:45:36,138 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:45:36,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 10:45:36,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 10:45:36,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 10:45:37,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 10:45:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:37,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:38,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_700))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))) is different from false [2022-11-20 10:45:38,349 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_699) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_700))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (select (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse1) (< .cse1 2147483649))))) is different from false [2022-11-20 10:45:38,385 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_697) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_699) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_700))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< .cse0 2147483649) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0)))))) is different from false [2022-11-20 10:45:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 10:45:39,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834679926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:45:39,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:45:39,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2022-11-20 10:45:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818079116] [2022-11-20 10:45:39,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:45:39,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 10:45:39,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:39,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 10:45:39,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=478, Unknown=26, NotChecked=144, Total=756 [2022-11-20 10:45:39,245 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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-20 10:45:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:52,739 INFO L93 Difference]: Finished difference Result 74 states and 87 transitions. [2022-11-20 10:45:52,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:45:52,739 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 10:45:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:52,740 INFO L225 Difference]: With dead ends: 74 [2022-11-20 10:45:52,741 INFO L226 Difference]: Without dead ends: 73 [2022-11-20 10:45:52,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=255, Invalid=1122, Unknown=41, NotChecked=222, Total=1640 [2022-11-20 10:45:52,742 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:52,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 101 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 192 Unchecked, 0.1s Time] [2022-11-20 10:45:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-20 10:45:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2022-11-20 10:45:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 64 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:45:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 77 transitions. [2022-11-20 10:45:52,758 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 77 transitions. Word has length 22 [2022-11-20 10:45:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:52,758 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 77 transitions. [2022-11-20 10:45:52,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 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-20 10:45:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 77 transitions. [2022-11-20 10:45:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:45:52,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:52,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:52,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-20 10:45:52,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 10:45:52,967 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash -93150317, now seen corresponding path program 3 times [2022-11-20 10:45:52,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:52,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960359324] [2022-11-20 10:45:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:52,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:53,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960359324] [2022-11-20 10:45:53,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960359324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:45:53,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754815171] [2022-11-20 10:45:53,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:45:53,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:45:53,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:45:53,472 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:45:53,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 10:45:53,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:45:53,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:45:53,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-20 10:45:53,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:53,804 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:45:53,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:45:53,819 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-20 10:45:53,835 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-20 10:45:53,851 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-20 10:45:53,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:53,929 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:53,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:53,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2022-11-20 10:45:53,941 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-20 10:45:54,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:54,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:54,043 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-20 10:45:54,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 98 [2022-11-20 10:45:54,076 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-20 10:45:54,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:54,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2022-11-20 10:45:54,102 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-20 10:45:54,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:45:54,163 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:45:54,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2022-11-20 10:45:54,170 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-20 10:45:54,521 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 10:45:54,521 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 388 treesize of output 362 [2022-11-20 10:45:54,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:45:54,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 10:45:54,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:45:54,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:45:54,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2022-11-20 10:45:55,094 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:45:55,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2022-11-20 10:45:55,219 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 10:45:55,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 29 [2022-11-20 10:45:55,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:45:55,288 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 32 treesize of output 24 [2022-11-20 10:45:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:45:55,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:45:55,659 INFO L321 Elim1Store]: treesize reduction 36, result has 32.1 percent of original size [2022-11-20 10:45:55,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 44 [2022-11-20 10:45:55,670 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-20 10:45:55,671 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 87 treesize of output 63 [2022-11-20 10:45:55,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:45:55,682 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 58 treesize of output 58 [2022-11-20 10:45:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 7 refuted. 3 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:45:56,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754815171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:45:56,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:45:56,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-11-20 10:45:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370140799] [2022-11-20 10:45:56,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:45:56,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 10:45:56,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:45:56,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 10:45:56,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=542, Unknown=12, NotChecked=0, Total=650 [2022-11-20 10:45:56,146 INFO L87 Difference]: Start difference. First operand 65 states and 77 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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-20 10:45:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:45:57,695 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2022-11-20 10:45:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:45:57,696 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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 23 [2022-11-20 10:45:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:45:57,697 INFO L225 Difference]: With dead ends: 102 [2022-11-20 10:45:57,697 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 10:45:57,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=534, Invalid=1904, Unknown=12, NotChecked=0, Total=2450 [2022-11-20 10:45:57,699 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 226 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:45:57,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 29 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 175 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2022-11-20 10:45:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 10:45:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38. [2022-11-20 10:45:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:45:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-11-20 10:45:57,711 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 23 [2022-11-20 10:45:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:45:57,711 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-11-20 10:45:57,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 26 states have internal predecessors, (62), 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-20 10:45:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-11-20 10:45:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:45:57,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:45:57,713 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:45:57,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-20 10:45:57,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:45:57,920 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:45:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:45:57,921 INFO L85 PathProgramCache]: Analyzing trace with hash -93148523, now seen corresponding path program 1 times [2022-11-20 10:45:57,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:45:57,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602380920] [2022-11-20 10:45:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:57,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:45:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:45:58,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:45:58,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602380920] [2022-11-20 10:45:58,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602380920] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:45:58,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174741977] [2022-11-20 10:45:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:45:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:45:58,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:45:58,600 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:45:58,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 10:45:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:45:58,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-20 10:45:58,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:45:58,954 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:45:58,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:45:58,972 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-20 10:45:58,992 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-20 10:45:59,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-11-20 10:45:59,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:59,145 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2022-11-20 10:45:59,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 103 [2022-11-20 10:45:59,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 10:45:59,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:59,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:59,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:59,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:45:59,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2022-11-20 10:45:59,234 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-20 10:45:59,270 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:45:59,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 20 [2022-11-20 10:45:59,275 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-20 10:46:00,895 INFO L321 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2022-11-20 10:46:00,895 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 464 treesize of output 455 [2022-11-20 10:46:00,947 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-20 10:46:00,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:46:01,003 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-20 10:46:01,016 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-20 10:46:01,037 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 18 treesize of output 15 [2022-11-20 10:46:01,118 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-20 10:46:01,118 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 10:46:01,443 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-20 10:46:01,443 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 61 treesize of output 72 [2022-11-20 10:46:01,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:46:01,491 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 49 treesize of output 51 [2022-11-20 10:46:01,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:01,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:01,828 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-20 10:46:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:01,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:01,917 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int))) (< 0 (+ 2147483648 (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))) is different from false [2022-11-20 10:46:04,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_848 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))) is different from false [2022-11-20 10:46:04,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_846))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_848 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-20 10:46:04,114 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_846 (Array Int Int)) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_848 Int) (v_ArrVal_844 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_844)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_846))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_848)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_848 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_844))))))) is different from false [2022-11-20 10:46:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-20 10:46:04,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174741977] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:04,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:04,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2022-11-20 10:46:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883902284] [2022-11-20 10:46:04,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:04,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-20 10:46:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:04,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-20 10:46:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=661, Unknown=12, NotChecked=228, Total=1056 [2022-11-20 10:46:04,427 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:46:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:06,066 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-20 10:46:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 10:46:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 10:46:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:06,067 INFO L225 Difference]: With dead ends: 56 [2022-11-20 10:46:06,067 INFO L226 Difference]: Without dead ends: 55 [2022-11-20 10:46:06,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=234, Invalid=1096, Unknown=18, NotChecked=292, Total=1640 [2022-11-20 10:46:06,069 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:06,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 77 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2022-11-20 10:46:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-20 10:46:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-11-20 10:46:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 53 states have internal predecessors, (56), 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-20 10:46:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-20 10:46:06,109 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 23 [2022-11-20 10:46:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:06,109 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-20 10:46:06,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:46:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-20 10:46:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:46:06,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:06,111 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-20 10:46:06,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:06,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 10:46:06,318 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1427316007, now seen corresponding path program 2 times [2022-11-20 10:46:06,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:06,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442081514] [2022-11-20 10:46:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:06,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:06,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442081514] [2022-11-20 10:46:06,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442081514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:06,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435622289] [2022-11-20 10:46:06,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:46:06,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:06,930 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:06,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 10:46:07,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:46:07,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:07,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-20 10:46:07,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:07,245 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:46:07,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:46:07,261 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-20 10:46:07,275 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-20 10:46:07,291 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-20 10:46:07,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:07,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 35 [2022-11-20 10:46:07,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-11-20 10:46:07,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:07,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:07,963 INFO L321 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-11-20 10:46:07,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 165 [2022-11-20 10:46:08,431 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-20 10:46:08,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2022-11-20 10:46:08,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 10:46:08,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:08,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:46:08,724 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 17 treesize of output 9 [2022-11-20 10:46:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:08,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:08,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-20 10:46:08,958 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< (+ v_ArrVal_921 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-20 10:46:08,997 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_918 1))) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-20 10:46:09,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_918 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-20 10:46:09,065 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_918 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-20 10:46:09,092 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (= .cse0 0) (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_918 Int) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_921 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_918)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_920))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_921 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_921)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_918 1) .cse0)))))))) is different from false [2022-11-20 10:46:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-11-20 10:46:09,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435622289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:09,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:09,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 33 [2022-11-20 10:46:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861846901] [2022-11-20 10:46:09,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:09,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 10:46:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 10:46:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=572, Unknown=12, NotChecked=342, Total=1122 [2022-11-20 10:46:09,211 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 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-20 10:46:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:10,035 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2022-11-20 10:46:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:46:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 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 25 [2022-11-20 10:46:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:10,036 INFO L225 Difference]: With dead ends: 64 [2022-11-20 10:46:10,036 INFO L226 Difference]: Without dead ends: 63 [2022-11-20 10:46:10,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=285, Invalid=911, Unknown=18, NotChecked=426, Total=1640 [2022-11-20 10:46:10,038 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:10,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 187 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 208 Invalid, 0 Unknown, 246 Unchecked, 0.3s Time] [2022-11-20 10:46:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-20 10:46:10,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-20 10:46:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:46:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-11-20 10:46:10,054 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 25 [2022-11-20 10:46:10,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:10,055 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-11-20 10:46:10,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 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-20 10:46:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-11-20 10:46:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 10:46:10,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:10,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:10,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:10,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 10:46:10,264 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash -438711859, now seen corresponding path program 2 times [2022-11-20 10:46:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:10,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301203134] [2022-11-20 10:46:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:10,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:10,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301203134] [2022-11-20 10:46:10,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301203134] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:10,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057982769] [2022-11-20 10:46:10,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:46:10,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:10,775 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:10,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 10:46:10,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:46:10,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:10,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 10:46:10,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:11,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 10:46:11,110 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 10:46:11,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-20 10:46:11,119 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-20 10:46:11,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-20 10:46:11,393 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 10:46:11,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2022-11-20 10:46:11,448 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 17 treesize of output 9 [2022-11-20 10:46:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:11,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:11,857 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_test_fun_~x_ref~0#1.base| Int) (v_ArrVal_994 Int) (v_ArrVal_992 (Array Int Int)) (v_ArrVal_996 Int)) (let ((.cse2 (store |c_#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_992))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< v_ArrVal_994 (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1)) (< 0 (+ (select (select (let ((.cse1 (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_994)))) (store .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse1 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_996))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483650)) (< (+ v_ArrVal_996 2147483648) 0))))) is different from false [2022-11-20 10:46:11,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:46:11,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 66 [2022-11-20 10:46:11,971 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 172 treesize of output 166 [2022-11-20 10:46:11,980 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 178 treesize of output 172 [2022-11-20 10:46:11,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 101 [2022-11-20 10:46:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-20 10:46:12,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057982769] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:12,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:12,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2022-11-20 10:46:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233363356] [2022-11-20 10:46:12,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:12,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 10:46:12,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:12,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 10:46:12,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=446, Unknown=1, NotChecked=44, Total=600 [2022-11-20 10:46:12,066 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 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-20 10:46:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:12,844 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-11-20 10:46:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:46:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 10:46:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:12,845 INFO L225 Difference]: With dead ends: 62 [2022-11-20 10:46:12,845 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 10:46:12,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=748, Unknown=1, NotChecked=60, Total=1056 [2022-11-20 10:46:12,847 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 71 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:12,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 43 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 30 Unchecked, 0.2s Time] [2022-11-20 10:46:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 10:46:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-20 10:46:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 60 states have internal predecessors, (62), 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-20 10:46:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-11-20 10:46:12,864 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 26 [2022-11-20 10:46:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:12,865 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-11-20 10:46:12,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 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-20 10:46:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-11-20 10:46:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 10:46:12,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:12,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:12,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:46:13,075 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:13,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 946515818, now seen corresponding path program 2 times [2022-11-20 10:46:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:13,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003428273] [2022-11-20 10:46:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:13,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:13,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003428273] [2022-11-20 10:46:13,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003428273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:13,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048310377] [2022-11-20 10:46:13,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:46:13,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:13,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:13,911 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:13,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 10:46:14,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:46:14,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:14,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 10:46:14,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:14,344 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:46:14,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:46:14,365 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-20 10:46:14,387 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-20 10:46:14,407 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-20 10:46:14,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:14,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:14,740 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-20 10:46:14,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 92 treesize of output 83 [2022-11-20 10:46:14,748 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-20 10:46:14,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:14,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:14,799 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:46:14,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 216 [2022-11-20 10:46:14,829 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-20 10:46:14,949 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-20 10:46:14,964 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-20 10:46:15,025 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:46:15,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 25 [2022-11-20 10:46:15,031 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-20 10:46:15,534 INFO L321 Elim1Store]: treesize reduction 52, result has 40.2 percent of original size [2022-11-20 10:46:15,535 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 40 treesize of output 54 [2022-11-20 10:46:15,628 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:46:15,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 10:46:15,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:15,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:15,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:15,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:46:16,033 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 17 treesize of output 9 [2022-11-20 10:46:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:16,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:16,098 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-20 10:46:20,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1079 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-20 10:46:20,348 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1077 1))) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-20 10:46:20,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1077 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1079 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-20 10:46:20,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1075))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1077 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-20 10:46:20,502 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1073 Int) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1073)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1075))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1077 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1073)))))))) is different from false [2022-11-20 10:46:20,588 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1073 Int) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1077 Int) (v_ArrVal_1079 Int) (v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1075 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1073)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1075))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1077)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1078))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1079)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1081) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1077 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1079 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1073)))))))) |c_ULTIMATE.start_test_fun_#t~short7#1|) is different from false [2022-11-20 10:46:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2022-11-20 10:46:20,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048310377] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:20,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:20,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 38 [2022-11-20 10:46:20,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146473452] [2022-11-20 10:46:20,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:20,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 10:46:20,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 10:46:20,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=759, Unknown=17, NotChecked=462, Total=1482 [2022-11-20 10:46:20,728 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:46:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:21,868 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-11-20 10:46:21,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 10:46:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 10:46:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:21,869 INFO L225 Difference]: With dead ends: 77 [2022-11-20 10:46:21,869 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:46:21,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 41 SyntacticMatches, 11 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=426, Invalid=1300, Unknown=24, NotChecked=602, Total=2352 [2022-11-20 10:46:21,871 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 100 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:21,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 103 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 148 Invalid, 0 Unknown, 271 Unchecked, 0.2s Time] [2022-11-20 10:46:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:46:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-11-20 10:46:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 68 states have internal predecessors, (71), 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-20 10:46:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-11-20 10:46:21,889 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 31 [2022-11-20 10:46:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:21,890 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-11-20 10:46:21,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.3421052631578947) internal successors, (89), 39 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:46:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-11-20 10:46:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 10:46:21,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:21,891 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:21,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:22,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:46:22,098 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash -931363604, now seen corresponding path program 4 times [2022-11-20 10:46:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:22,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662480696] [2022-11-20 10:46:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:22,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:22,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662480696] [2022-11-20 10:46:22,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662480696] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:22,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820647280] [2022-11-20 10:46:22,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:46:22,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:22,758 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:22,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 10:46:22,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:46:22,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:22,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 10:46:22,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:23,163 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:46:23,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:46:23,184 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-20 10:46:23,206 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-20 10:46:23,226 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-20 10:46:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:23,621 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-20 10:46:23,622 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 329 treesize of output 298 [2022-11-20 10:46:23,700 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-20 10:46:23,759 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-20 10:46:27,465 INFO L321 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2022-11-20 10:46:27,465 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 870 treesize of output 901 [2022-11-20 10:46:27,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:46:27,699 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-20 10:46:27,733 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-20 10:46:27,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-20 10:46:28,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:28,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:28,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:28,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:28,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:28,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:28,687 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-20 10:46:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:28,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:28,831 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (or (not (<= v_ArrVal_1169 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-20 10:46:28,852 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-20 10:46:28,864 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169))))) is different from false [2022-11-20 10:46:28,930 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (not (<= v_ArrVal_1167 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))) is different from false [2022-11-20 10:46:28,970 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1171 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167)))))) is different from false [2022-11-20 10:46:28,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167))))))) is different from false [2022-11-20 10:46:29,084 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1163 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))))) is different from false [2022-11-20 10:46:29,144 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1163)))))))) is different from false [2022-11-20 10:46:29,179 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1162))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1163) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169)))))))))) is different from false [2022-11-20 10:46:29,475 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1163 Int) (v_ArrVal_1167 Int) (v_ArrVal_1168 (Array Int Int)) (v_ArrVal_1169 Int) (v_ArrVal_1165 (Array Int Int)) (v_ArrVal_1162 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1162))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1163)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1165))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1167)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1168))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1163) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1167) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1169)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1171) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1169))))))))) (forall ((|ULTIMATE.start_test_fun_~y_ref~0#1.offset| Int)) (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (or (< .cse6 1) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ .cse6 1)))))) is different from false [2022-11-20 10:46:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 37 not checked. [2022-11-20 10:46:29,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820647280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:29,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:29,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2022-11-20 10:46:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31951135] [2022-11-20 10:46:29,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:29,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-20 10:46:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:29,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-20 10:46:29,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=668, Unknown=14, NotChecked=650, Total=1560 [2022-11-20 10:46:29,499 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 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-20 10:46:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:31,034 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-11-20 10:46:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:46:31,034 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 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 33 [2022-11-20 10:46:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:31,035 INFO L225 Difference]: With dead ends: 70 [2022-11-20 10:46:31,035 INFO L226 Difference]: Without dead ends: 69 [2022-11-20 10:46:31,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=344, Invalid=1013, Unknown=15, NotChecked=790, Total=2162 [2022-11-20 10:46:31,036 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:31,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 83 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 76 Invalid, 0 Unknown, 196 Unchecked, 0.1s Time] [2022-11-20 10:46:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-20 10:46:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2022-11-20 10:46:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 48 states have internal predecessors, (50), 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-20 10:46:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-11-20 10:46:31,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 33 [2022-11-20 10:46:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:31,054 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-11-20 10:46:31,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.4615384615384617) internal successors, (96), 40 states have internal predecessors, (96), 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-20 10:46:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-11-20 10:46:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-20 10:46:31,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:31,056 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2022-11-20 10:46:31,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:31,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:31,262 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:31,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1011890224, now seen corresponding path program 1 times [2022-11-20 10:46:31,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:31,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709880234] [2022-11-20 10:46:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709880234] [2022-11-20 10:46:31,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709880234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:31,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129578680] [2022-11-20 10:46:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:31,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:31,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:31,928 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:31,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 10:46:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:32,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-20 10:46:32,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:32,331 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:46:32,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:46:32,352 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-20 10:46:32,370 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-20 10:46:32,388 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-20 10:46:32,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:33,098 INFO L321 Elim1Store]: treesize reduction 86, result has 44.2 percent of original size [2022-11-20 10:46:33,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 278 treesize of output 291 [2022-11-20 10:46:33,119 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 164 treesize of output 162 [2022-11-20 10:46:33,175 INFO L321 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2022-11-20 10:46:33,176 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 112 treesize of output 47 [2022-11-20 10:46:33,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:33,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:33,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:33,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 9 [2022-11-20 10:46:33,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:33,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:33,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:33,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:33,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 16 [2022-11-20 10:46:33,374 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:46:33,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 10:46:33,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:33,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:33,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:33,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:33,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:33,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:33,867 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-20 10:46:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:33,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:33,983 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (or (not (<= v_ArrVal_1259 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-20 10:46:34,005 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-20 10:46:34,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-20 10:46:34,102 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259) (not (<= v_ArrVal_1257 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))) is different from false [2022-11-20 10:46:34,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257)))))) is different from false [2022-11-20 10:46:34,155 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257))))))) is different from false [2022-11-20 10:46:34,249 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257) (< (+ 1 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1259) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1254 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))))) is different from false [2022-11-20 10:46:34,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1261 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ 1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1259) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-20 10:46:34,327 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1252))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259))))))))) is different from false [2022-11-20 10:46:34,404 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1252))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259)))))))))) is different from false [2022-11-20 10:46:34,439 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (forall ((v_ArrVal_1258 (Array Int Int)) (v_ArrVal_1254 Int) (v_ArrVal_1255 (Array Int Int)) (v_ArrVal_1257 Int) (v_ArrVal_1259 Int) (v_ArrVal_1252 (Array Int Int)) (v_ArrVal_1261 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1252))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1254)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1255))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1257)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1258))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1259)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1261) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1257) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1254) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1259)))))))))) is different from false [2022-11-20 10:46:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 45 not checked. [2022-11-20 10:46:34,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129578680] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:34,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:34,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 37 [2022-11-20 10:46:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324558481] [2022-11-20 10:46:34,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:34,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 10:46:34,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:34,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 10:46:34,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=524, Unknown=12, NotChecked=660, Total=1406 [2022-11-20 10:46:34,531 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 states have internal predecessors, (102), 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-20 10:46:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:34,956 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-11-20 10:46:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:46:34,956 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 states have internal predecessors, (102), 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 35 [2022-11-20 10:46:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:34,957 INFO L225 Difference]: With dead ends: 85 [2022-11-20 10:46:34,957 INFO L226 Difference]: Without dead ends: 84 [2022-11-20 10:46:34,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=302, Invalid=722, Unknown=12, NotChecked=770, Total=1806 [2022-11-20 10:46:34,959 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:34,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 80 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 320 Unchecked, 0.1s Time] [2022-11-20 10:46:34,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-20 10:46:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2022-11-20 10:46:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.04) internal successors, (78), 76 states have internal predecessors, (78), 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-20 10:46:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-11-20 10:46:34,976 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 35 [2022-11-20 10:46:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:34,977 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-11-20 10:46:34,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 38 states have internal predecessors, (102), 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-20 10:46:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-11-20 10:46:34,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:46:34,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:34,978 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:34,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:35,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:35,184 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1703428993, now seen corresponding path program 5 times [2022-11-20 10:46:35,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:35,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944429154] [2022-11-20 10:46:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:35,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:35,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944429154] [2022-11-20 10:46:35,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944429154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:35,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697615719] [2022-11-20 10:46:35,947 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:46:35,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:35,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:35,951 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:35,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 10:46:36,183 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-11-20 10:46:36,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:36,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-20 10:46:36,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:36,380 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:46:36,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:46:36,399 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-20 10:46:36,418 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-20 10:46:36,438 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-20 10:46:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:36,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:36,876 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:46:36,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 51 [2022-11-20 10:46:36,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:36,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:36,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:36,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:36,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:36,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2022-11-20 10:46:36,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:46:37,392 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:46:37,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 10:46:37,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:37,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:37,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:37,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:37,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:37,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:37,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:38,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:46:38,047 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-20 10:46:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:38,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:38,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1362 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-20 10:46:38,130 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1360 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))) is different from false [2022-11-20 10:46:38,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1360 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360)))) is different from false [2022-11-20 10:46:38,166 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360))))) is different from false [2022-11-20 10:46:38,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_1358 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-20 10:46:38,268 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) is different from false [2022-11-20 10:46:38,290 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360))))))) is different from false [2022-11-20 10:46:38,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (not (<= v_ArrVal_1354 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-20 10:46:38,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1354) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))) is different from false [2022-11-20 10:46:38,475 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1353))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1354) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358))))))))) is different from false [2022-11-20 10:46:38,624 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1353))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1354) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (not (<= v_ArrVal_1352 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360))))))))) is different from false [2022-11-20 10:46:38,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1353))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1354) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1352) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360)))))))))) is different from false [2022-11-20 10:46:38,759 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1350))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1353))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1352) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1354) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))) is different from false [2022-11-20 10:46:38,804 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1350))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1353))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1352) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1354) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))))))) is different from false [2022-11-20 10:46:38,850 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1360 Int) (v_ArrVal_1352 Int) (v_ArrVal_1354 Int) (v_ArrVal_1356 (Array Int Int)) (v_ArrVal_1353 (Array Int Int)) (v_ArrVal_1358 Int) (v_ArrVal_1362 (Array Int Int)) (v_ArrVal_1350 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1350))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1352)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1353))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1354)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1356))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1358)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1359))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1352) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1360) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1358) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1354) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1360)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1362) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))))))))) is different from false [2022-11-20 10:46:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 68 not checked. [2022-11-20 10:46:38,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697615719] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:38,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:38,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 18] total 44 [2022-11-20 10:46:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485911737] [2022-11-20 10:46:38,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:38,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-20 10:46:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:38,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-20 10:46:38,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=657, Unknown=15, NotChecked=1050, Total=1980 [2022-11-20 10:46:38,957 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 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-20 10:46:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:39,967 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-11-20 10:46:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:46:39,968 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 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 41 [2022-11-20 10:46:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:39,969 INFO L225 Difference]: With dead ends: 87 [2022-11-20 10:46:39,969 INFO L226 Difference]: Without dead ends: 86 [2022-11-20 10:46:39,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 57 SyntacticMatches, 18 SemanticMatches, 49 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=388, Invalid=917, Unknown=15, NotChecked=1230, Total=2550 [2022-11-20 10:46:39,971 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 427 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:39,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 86 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 116 Invalid, 0 Unknown, 427 Unchecked, 0.1s Time] [2022-11-20 10:46:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-20 10:46:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-11-20 10:46:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 84 states have internal predecessors, (87), 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-20 10:46:39,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2022-11-20 10:46:39,988 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 41 [2022-11-20 10:46:39,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:39,989 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2022-11-20 10:46:39,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.727272727272727) internal successors, (120), 45 states have internal predecessors, (120), 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-20 10:46:39,989 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-11-20 10:46:39,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 10:46:39,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:39,990 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-11-20 10:46:40,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:40,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:40,197 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2134392707, now seen corresponding path program 3 times [2022-11-20 10:46:40,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:40,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366659656] [2022-11-20 10:46:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:40,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:41,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366659656] [2022-11-20 10:46:41,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366659656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:41,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84346147] [2022-11-20 10:46:41,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:46:41,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:41,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:41,211 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:41,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 10:46:41,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 10:46:41,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:41,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-20 10:46:41,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:41,565 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:46:41,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-11-20 10:46:41,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-11-20 10:46:41,594 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-20 10:46:41,610 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-20 10:46:41,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:41,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:41,714 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-20 10:46:41,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 94 [2022-11-20 10:46:41,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:41,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:41,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 86 [2022-11-20 10:46:43,577 INFO L321 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2022-11-20 10:46:43,577 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 1271 treesize of output 1258 [2022-11-20 10:46:43,989 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 22 treesize of output 17 [2022-11-20 10:46:44,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 10:46:44,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:46:44,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:46:44,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:46:44,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:46:44,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:46:44,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:46:44,615 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 17 treesize of output 9 [2022-11-20 10:46:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:44,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:44,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1457 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1457 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-20 10:46:44,999 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1454 1))) (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1457 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-20 10:46:45,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1457 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1454 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-20 10:46:45,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1457 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1454 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-20 10:46:45,120 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1454 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1457 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1450 1))))))))) is different from false [2022-11-20 10:46:45,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1450 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1454 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1457 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))) is different from false [2022-11-20 10:46:45,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1449))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1457 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1450 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1454 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-20 10:46:45,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int) (v_ArrVal_1448 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1448)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1449))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1450 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1454 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1457 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1448 1))))))))))) is different from false [2022-11-20 10:46:45,372 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int) (v_ArrVal_1448 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1448)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1449))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1450 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1454 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1457 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1448 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))))) is different from false [2022-11-20 10:46:45,409 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int) (v_ArrVal_1448 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1448)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1449))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1450 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1454 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1457 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1448 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))))) (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0)) is different from false [2022-11-20 10:46:45,450 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1450 Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1454 Int) (v_ArrVal_1457 Int) (v_ArrVal_1448 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1448)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1449))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1450)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1452))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1454)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1455))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1450 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1454 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1457 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1448 1) .cse3) (< 0 (+ (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1457)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))))) (= .cse3 0)))) is different from false [2022-11-20 10:46:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 63 not checked. [2022-11-20 10:46:45,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84346147] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:45,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:45,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 18] total 49 [2022-11-20 10:46:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290685781] [2022-11-20 10:46:45,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:45,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-20 10:46:45,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-20 10:46:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1094, Unknown=58, NotChecked=924, Total=2450 [2022-11-20 10:46:45,626 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 50 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 50 states have internal predecessors, (119), 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-20 10:46:57,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:57,701 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-11-20 10:46:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:46:57,702 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 50 states have internal predecessors, (119), 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 41 [2022-11-20 10:46:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:57,703 INFO L225 Difference]: With dead ends: 94 [2022-11-20 10:46:57,703 INFO L226 Difference]: Without dead ends: 93 [2022-11-20 10:46:57,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 54 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=595, Invalid=1824, Unknown=75, NotChecked=1166, Total=3660 [2022-11-20 10:46:57,705 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:57,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 124 Unchecked, 0.1s Time] [2022-11-20 10:46:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-20 10:46:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-20 10:46:57,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.032967032967033) internal successors, (94), 92 states have internal predecessors, (94), 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-20 10:46:57,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-11-20 10:46:57,716 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 41 [2022-11-20 10:46:57,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:57,716 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-11-20 10:46:57,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 50 states have internal predecessors, (119), 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-20 10:46:57,717 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-11-20 10:46:57,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 10:46:57,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:57,717 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:57,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:57,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 10:46:57,919 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:46:57,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:57,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2144651796, now seen corresponding path program 3 times [2022-11-20 10:46:57,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087253488] [2022-11-20 10:46:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:46:58,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:58,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087253488] [2022-11-20 10:46:58,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087253488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:58,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992714763] [2022-11-20 10:46:58,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:46:58,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:58,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:58,916 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:58,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 10:46:59,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 10:46:59,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:59,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 10:46:59,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:59,272 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:46:59,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:46:59,286 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-20 10:46:59,301 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-20 10:46:59,315 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-20 10:46:59,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:46:59,592 INFO L321 Elim1Store]: treesize reduction 69, result has 18.8 percent of original size [2022-11-20 10:46:59,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 239 [2022-11-20 10:46:59,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:46:59,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 11 [2022-11-20 10:47:01,396 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (<= 1 (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not (= (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0)) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (= (select .cse9 0) 0)) (.cse5 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (and (exists ((v_DerPreprocessor_663 (Array Int Int))) (and (= (select v_DerPreprocessor_663 0) 0) (exists ((v_DerPreprocessor_662 (Array Int Int)) (v_DerPreprocessor_661 (Array Int Int))) (let ((.cse3 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_661) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_662) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_663) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_661) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_662) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_663))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= .cse1 .cse2) (= v_DerPreprocessor_662 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (exists ((v_prenex_2797 (Array Int Int)) (v_prenex_2798 (Array Int Int)) (v_prenex_2799 (Array Int Int))) (let ((.cse4 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_2799) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_2798) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_2797) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_2799) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_2798) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_2797))) (and (= v_prenex_2798 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= .cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_prenex_2797 0) 0)))))))))) .cse5 .cse6) (and (exists ((v_DerPreprocessor_659 (Array Int Int)) (v_DerPreprocessor_658 (Array Int Int))) (let ((.cse7 (store (store (store (store (store (store (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_658) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_659) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse9) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_658) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_659) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse9) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_658) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_659) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse9) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_658) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_659) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse9))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) .cse0) (= v_DerPreprocessor_658 .cse8) (= .cse1 .cse8))))) .cse6 (not .cse5))))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-11-20 10:47:01,452 INFO L321 Elim1Store]: treesize reduction 54, result has 21.7 percent of original size [2022-11-20 10:47:01,452 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 1142 treesize of output 1105 [2022-11-20 10:47:01,619 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 15 treesize of output 12 [2022-11-20 10:47:01,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:01,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-20 10:47:01,713 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:01,713 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 37 [2022-11-20 10:47:01,847 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:47:01,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 10:47:01,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:02,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:02,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:02,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:02,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:02,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:02,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:02,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:02,599 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 17 treesize of output 9 [2022-11-20 10:47:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 82 refuted. 8 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 10:47:02,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:02,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-20 10:47:02,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1563 1))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))) is different from false [2022-11-20 10:47:02,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))) is different from false [2022-11-20 10:47:02,746 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-20 10:47:02,776 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1561 1))) (< (+ v_ArrVal_1563 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))) is different from false [2022-11-20 10:47:02,803 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< (+ v_ArrVal_1561 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1563 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2022-11-20 10:47:02,842 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1561 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-20 10:47:02,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1561 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1563 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1558 1))))))))) is different from false [2022-11-20 10:47:02,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1558 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1563 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))) is different from false [2022-11-20 10:47:02,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1556))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1563 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1558 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-20 10:47:03,067 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1554 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1554)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1556))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1554 1))) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1558 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-20 10:47:03,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1554 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1554)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1556))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1554 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1558 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) is different from false [2022-11-20 10:47:03,223 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1554 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1553))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1554)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1556))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1558 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1554 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1563 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-20 10:47:03,325 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1552 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1554 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1552)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1553))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1554)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1556))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1552)) (< (+ v_ArrVal_1558 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1554 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-20 10:47:03,371 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1552 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1554 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1552)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1553))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1554)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1556))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1552)) (< (+ v_ArrVal_1558 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1554 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))))) is different from false [2022-11-20 10:47:03,419 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (= (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (forall ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1561 Int) (v_ArrVal_1552 Int) (v_ArrVal_1563 Int) (v_ArrVal_1565 (Array Int Int)) (v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1554 Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1558 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1552)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1553))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1554)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1556))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1558)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1559))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1561)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1562))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1563 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1563)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1552)) (< (+ v_ArrVal_1558 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1561 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1554 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))))) is different from false [2022-11-20 10:47:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 95 not checked. [2022-11-20 10:47:03,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992714763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:03,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:03,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 21] total 58 [2022-11-20 10:47:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569526146] [2022-11-20 10:47:03,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:03,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-20 10:47:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:03,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-20 10:47:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1312, Unknown=107, NotChecked=1632, Total=3422 [2022-11-20 10:47:03,742 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 59 states, 58 states have (on average 2.3620689655172415) internal successors, (137), 59 states have internal predecessors, (137), 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-20 10:47:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:06,751 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-11-20 10:47:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 10:47:06,752 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.3620689655172415) internal successors, (137), 59 states have internal predecessors, (137), 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 47 [2022-11-20 10:47:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:06,753 INFO L225 Difference]: With dead ends: 104 [2022-11-20 10:47:06,753 INFO L226 Difference]: Without dead ends: 103 [2022-11-20 10:47:06,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=544, Invalid=2258, Unknown=128, NotChecked=2040, Total=4970 [2022-11-20 10:47:06,755 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 70 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 549 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:06,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 188 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 549 Unchecked, 0.2s Time] [2022-11-20 10:47:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-20 10:47:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 59. [2022-11-20 10:47:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-11-20 10:47:06,772 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 47 [2022-11-20 10:47:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:06,772 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-11-20 10:47:06,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.3620689655172415) internal successors, (137), 59 states have internal predecessors, (137), 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-20 10:47:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-11-20 10:47:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-20 10:47:06,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:06,773 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:06,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:06,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:06,979 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:47:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:06,979 INFO L85 PathProgramCache]: Analyzing trace with hash -573924074, now seen corresponding path program 6 times [2022-11-20 10:47:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:06,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187255270] [2022-11-20 10:47:06,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:06,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:07,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187255270] [2022-11-20 10:47:07,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187255270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:07,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954917976] [2022-11-20 10:47:07,726 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-20 10:47:07,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:07,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:07,727 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:07,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 10:47:08,008 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-11-20 10:47:08,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:47:08,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 10:47:08,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:08,167 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:47:08,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:47:08,182 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-20 10:47:08,196 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-20 10:47:08,210 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-20 10:47:08,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:08,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:08,521 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:47:08,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 62 [2022-11-20 10:47:08,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:08,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:08,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:08,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 16 [2022-11-20 10:47:08,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:08,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:08,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:08,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 11 [2022-11-20 10:47:08,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 10:47:08,816 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:47:08,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2022-11-20 10:47:08,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:08,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:09,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:09,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:09,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:09,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:09,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:09,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:09,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:09,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:09,389 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-20 10:47:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:09,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:09,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1676 Int)) (or (not (<= v_ArrVal_1676 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-20 10:47:09,502 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-20 10:47:09,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676))))) is different from false [2022-11-20 10:47:09,554 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1672 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676))))) is different from false [2022-11-20 10:47:09,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676)))))) is different from false [2022-11-20 10:47:09,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-11-20 10:47:09,667 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1670 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672))))))) is different from false [2022-11-20 10:47:09,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672)))))))) is different from false [2022-11-20 10:47:09,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670))))))))) is different from false [2022-11-20 10:47:09,838 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (not (<= v_ArrVal_1666 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670))))))))) is different from false [2022-11-20 10:47:09,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1666) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670)))))))))) is different from false [2022-11-20 10:47:09,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1665))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1666))))))))))) is different from false [2022-11-20 10:47:10,085 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1664)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1665))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (not (<= v_ArrVal_1664 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1666))))))))))) is different from false [2022-11-20 10:47:10,168 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1664)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1665))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1666) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1664)))))))))))) is different from false [2022-11-20 10:47:10,215 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1662))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1664)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1665))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1666) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1664))))))))))))) is different from false [2022-11-20 10:47:10,266 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1662))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1664)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1665))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1666) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1664)))))))))))))) is different from false [2022-11-20 10:47:10,313 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 0) (forall ((v_ArrVal_1668 (Array Int Int)) (v_ArrVal_1677 (Array Int Int)) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1670 Int) (v_ArrVal_1672 Int) (v_ArrVal_1674 (Array Int Int)) (v_ArrVal_1662 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1676 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1662))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1664)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1665))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1666)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1668))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1670)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1671))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1672)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1674))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1666) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1676)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1677) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1670) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1672) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1676) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1664)))))))))))))) is different from false [2022-11-20 10:47:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 105 not checked. [2022-11-20 10:47:10,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954917976] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:10,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:10,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 21] total 51 [2022-11-20 10:47:10,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700030770] [2022-11-20 10:47:10,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:10,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-20 10:47:10,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:10,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-20 10:47:10,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=895, Unknown=18, NotChecked=1394, Total=2652 [2022-11-20 10:47:10,427 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 52 states, 51 states have (on average 2.823529411764706) internal successors, (144), 52 states have internal predecessors, (144), 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-20 10:47:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:11,284 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-11-20 10:47:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 10:47:11,285 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.823529411764706) internal successors, (144), 52 states have internal predecessors, (144), 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 49 [2022-11-20 10:47:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:11,285 INFO L225 Difference]: With dead ends: 69 [2022-11-20 10:47:11,285 INFO L226 Difference]: Without dead ends: 68 [2022-11-20 10:47:11,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 68 SyntacticMatches, 18 SemanticMatches, 54 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=446, Invalid=1086, Unknown=18, NotChecked=1530, Total=3080 [2022-11-20 10:47:11,287 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:11,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 102 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 163 Invalid, 0 Unknown, 485 Unchecked, 0.1s Time] [2022-11-20 10:47:11,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-20 10:47:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2022-11-20 10:47:11,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 60 states have internal predecessors, (62), 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-20 10:47:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-11-20 10:47:11,302 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 49 [2022-11-20 10:47:11,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:11,303 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-11-20 10:47:11,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.823529411764706) internal successors, (144), 52 states have internal predecessors, (144), 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-20 10:47:11,303 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-11-20 10:47:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 10:47:11,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:11,304 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:11,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:11,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 10:47:11,507 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:47:11,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:11,507 INFO L85 PathProgramCache]: Analyzing trace with hash 321970153, now seen corresponding path program 4 times [2022-11-20 10:47:11,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:11,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3009732] [2022-11-20 10:47:11,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:12,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:12,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3009732] [2022-11-20 10:47:12,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3009732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:12,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595761814] [2022-11-20 10:47:12,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:47:12,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:12,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:12,747 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:12,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 10:47:12,954 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:47:12,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:47:12,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 10:47:12,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:13,117 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:47:13,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:47:13,135 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-20 10:47:13,151 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-20 10:47:13,165 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-20 10:47:13,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:13,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:13,495 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:47:13,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 53 [2022-11-20 10:47:13,500 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-20 10:47:13,509 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-20 10:47:13,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:13,571 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:47:13,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 177 [2022-11-20 10:47:13,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 10:47:13,674 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-20 10:47:14,796 INFO L321 Elim1Store]: treesize reduction 46, result has 33.3 percent of original size [2022-11-20 10:47:14,797 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 454 treesize of output 445 [2022-11-20 10:47:14,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:47:14,884 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-20 10:47:14,929 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-20 10:47:14,953 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 18 treesize of output 15 [2022-11-20 10:47:15,033 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-20 10:47:15,033 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-20 10:47:15,276 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-11-20 10:47:15,276 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 61 treesize of output 72 [2022-11-20 10:47:15,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:47:15,313 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 49 treesize of output 51 [2022-11-20 10:47:15,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:15,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:15,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:15,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:15,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:15,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:15,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:16,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:16,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:16,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:16,248 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 17 treesize of output 9 [2022-11-20 10:47:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:16,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:16,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1795 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-20 10:47:16,339 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1794 1))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))) is different from false [2022-11-20 10:47:16,355 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1794 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))) is different from false [2022-11-20 10:47:16,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1794 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-20 10:47:16,410 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1791 1))) (< (+ v_ArrVal_1794 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-20 10:47:16,440 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1791 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1794 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))) is different from false [2022-11-20 10:47:16,483 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1794 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1791 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-20 10:47:16,533 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1794 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1791 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1787 1))) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-20 10:47:16,575 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1794 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1791 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1787 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))) is different from false [2022-11-20 10:47:16,636 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1787 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1794 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1791 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-20 10:47:16,710 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1785 Int) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1785)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1785 1))) (< (+ v_ArrVal_1791 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1787 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1794 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-20 10:47:16,767 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1785 Int) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1785)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1791 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1785 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1787 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1794 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) is different from false [2022-11-20 10:47:16,858 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1783))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1785)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1794 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1785 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1791 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1787 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))))))) is different from false [2022-11-20 10:47:16,958 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1782 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1782)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1783))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1785)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< (+ v_ArrVal_1787 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_1782 1))) (< (+ v_ArrVal_1794 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1791 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1785 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-20 10:47:17,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1782 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1782)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1783))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1785)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (< (+ v_ArrVal_1787 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1794 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1791 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1782 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1785 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))))) is different from false [2022-11-20 10:47:17,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1782 Int) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1785 Int) (v_ArrVal_1787 Int) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1780 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1780))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1782)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1783))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1785)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_1787 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1785 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1794 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1791 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1782 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))))) is different from false [2022-11-20 10:47:17,295 WARN L837 $PredicateComparison]: unable to prove that (or (not (< |c_ULTIMATE.start_test_fun_#t~mem10#1| |c_ULTIMATE.start_test_fun_#t~mem9#1|)) (forall ((v_ArrVal_1789 (Array Int Int)) (v_ArrVal_1786 (Array Int Int)) (v_ArrVal_1795 (Array Int Int)) (v_ArrVal_1783 (Array Int Int)) (v_ArrVal_1792 (Array Int Int)) (v_ArrVal_1780 (Array Int Int)) (v_ArrVal_1791 Int) (v_ArrVal_1794 Int) (v_ArrVal_1782 Int) (v_ArrVal_1785 Int) (v_ArrVal_1787 Int) (v_ArrVal_1778 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1778)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1780))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1782)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1783))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1785)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1786))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1787)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1789))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1791)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1792))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) v_ArrVal_1778)) (< (+ v_ArrVal_1787 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1782 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1794)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_1795) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_1791 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1794 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_1785 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))))))) is different from false [2022-11-20 10:47:17,785 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 136 not checked. [2022-11-20 10:47:17,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595761814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:17,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:17,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 23] total 64 [2022-11-20 10:47:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357301418] [2022-11-20 10:47:17,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:17,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 10:47:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 10:47:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=1836, Unknown=19, NotChecked=1836, Total=4160 [2022-11-20 10:47:17,788 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 65 states, 64 states have (on average 2.515625) internal successors, (161), 65 states have internal predecessors, (161), 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-20 10:47:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:20,850 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2022-11-20 10:47:20,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 10:47:20,851 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.515625) internal successors, (161), 65 states have internal predecessors, (161), 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 55 [2022-11-20 10:47:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:20,851 INFO L225 Difference]: With dead ends: 111 [2022-11-20 10:47:20,851 INFO L226 Difference]: Without dead ends: 110 [2022-11-20 10:47:20,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 75 SyntacticMatches, 29 SemanticMatches, 75 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 2366 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=645, Invalid=2937, Unknown=26, NotChecked=2244, Total=5852 [2022-11-20 10:47:20,852 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 535 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:20,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 134 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 535 Unchecked, 0.1s Time] [2022-11-20 10:47:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-20 10:47:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-11-20 10:47:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.02803738317757) internal successors, (110), 108 states have internal predecessors, (110), 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-20 10:47:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-11-20 10:47:20,872 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 55 [2022-11-20 10:47:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:20,872 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-11-20 10:47:20,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.515625) internal successors, (161), 65 states have internal predecessors, (161), 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-20 10:47:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-11-20 10:47:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:47:20,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:20,872 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:20,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-20 10:47:21,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 10:47:21,073 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:47:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash 175673771, now seen corresponding path program 7 times [2022-11-20 10:47:21,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:21,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211598531] [2022-11-20 10:47:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:21,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:21,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211598531] [2022-11-20 10:47:21,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211598531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:21,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621055249] [2022-11-20 10:47:21,938 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 10:47:21,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:21,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:21,939 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:21,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 10:47:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:22,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-20 10:47:22,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:22,262 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:47:22,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:47:22,277 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-20 10:47:22,292 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-20 10:47:22,306 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-20 10:47:22,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:22,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:22,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:47:22,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 33 [2022-11-20 10:47:22,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:47:22,768 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-20 10:47:22,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:22,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:22,809 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:47:22,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 63 [2022-11-20 10:47:22,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-11-20 10:47:22,816 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-20 10:47:22,952 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 10:47:22,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 10:47:23,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:23,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:23,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:23,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:23,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:23,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:23,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:23,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:23,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:23,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:23,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:23,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 10:47:23,652 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-20 10:47:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:23,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:23,729 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1918 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-11-20 10:47:23,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int))) (or (not (<= v_ArrVal_1916 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-11-20 10:47:23,769 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) is different from false [2022-11-20 10:47:23,781 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ 1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1916) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-11-20 10:47:23,830 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_1914 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916))))) is different from false [2022-11-20 10:47:23,860 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916)))))) is different from false [2022-11-20 10:47:23,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1915 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916))))))) is different from false [2022-11-20 10:47:23,960 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (not (<= v_ArrVal_1910 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))))))))) is different from false [2022-11-20 10:47:24,002 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910)))))))) is different from false [2022-11-20 10:47:24,026 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916))))))))) is different from false [2022-11-20 10:47:24,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (not (<= v_ArrVal_1908 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916))))))))) is different from false [2022-11-20 10:47:24,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1908) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916)))))))))) is different from false [2022-11-20 10:47:24,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1908) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910))))))))))) is different from false [2022-11-20 10:47:24,390 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1905 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1905)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (+ 1 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1908) (not (<= v_ArrVal_1905 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916))))))))))) is different from false [2022-11-20 10:47:24,467 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1905 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1905)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (+ 1 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1908) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1905)))))))))))) is different from false [2022-11-20 10:47:24,510 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1905 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1903 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1903))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1905)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1905) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1908) (< (select (select (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))) is different from false [2022-11-20 10:47:24,714 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1905 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1901 Int) (v_ArrVal_1903 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1903))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1905)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse1 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1905) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1908) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_1901 (+ |c_ULTIMATE.start_test_fun_#t~mem13#1| 1))) (< (+ 1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1914) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916))))))))))))) is different from false [2022-11-20 10:47:24,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1905 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1901 Int) (v_ArrVal_1903 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1903))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1905)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1905) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1908) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1901) (< (+ 1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_1914) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916)))))))))))))) is different from false [2022-11-20 10:47:24,876 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1905 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1901 Int) (v_ArrVal_1903 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1900))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1903))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1905)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1905) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1901) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1908))))))))))))))) is different from false [2022-11-20 10:47:25,092 WARN L837 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_test_fun_#t~short7#1| (forall ((v_ArrVal_1912 (Array Int Int)) (v_ArrVal_1914 Int) (v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1905 Int) (v_ArrVal_1916 Int) (v_ArrVal_1908 Int) (v_ArrVal_1909 (Array Int Int)) (v_ArrVal_1918 (Array Int Int)) (v_ArrVal_1906 (Array Int Int)) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1901 Int) (v_ArrVal_1903 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1900))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1901)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1903))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1905)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1906))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1908)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1909))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1910)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1912))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1914)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1915))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1905) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_1916)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1918) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1916) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1910) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1914) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1901) (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_1908)))))))))))))))) is different from false [2022-11-20 10:47:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 150 not checked. [2022-11-20 10:47:25,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621055249] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:25,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:25,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 23] total 56 [2022-11-20 10:47:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076779894] [2022-11-20 10:47:25,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:25,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-20 10:47:25,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:25,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-20 10:47:25,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1004, Unknown=20, NotChecked=1780, Total=3192 [2022-11-20 10:47:25,129 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 57 states, 56 states have (on average 3.0) internal successors, (168), 57 states have internal predecessors, (168), 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-20 10:47:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:26,361 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2022-11-20 10:47:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 10:47:26,362 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.0) internal successors, (168), 57 states have internal predecessors, (168), 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 57 [2022-11-20 10:47:26,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:26,362 INFO L225 Difference]: With dead ends: 126 [2022-11-20 10:47:26,363 INFO L226 Difference]: Without dead ends: 125 [2022-11-20 10:47:26,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 82 SyntacticMatches, 23 SemanticMatches, 60 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=519, Invalid=1263, Unknown=20, NotChecked=1980, Total=3782 [2022-11-20 10:47:26,364 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 90 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:26,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 106 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 165 Invalid, 0 Unknown, 547 Unchecked, 0.2s Time] [2022-11-20 10:47:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-20 10:47:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2022-11-20 10:47:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.0347826086956522) internal successors, (119), 116 states have internal predecessors, (119), 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-20 10:47:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2022-11-20 10:47:26,388 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 57 [2022-11-20 10:47:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:26,388 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2022-11-20 10:47:26,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.0) internal successors, (168), 57 states have internal predecessors, (168), 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-20 10:47:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2022-11-20 10:47:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 10:47:26,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:26,389 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2022-11-20 10:47:26,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:26,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 10:47:26,595 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:47:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash -99022803, now seen corresponding path program 4 times [2022-11-20 10:47:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:26,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494731730] [2022-11-20 10:47:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:27,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494731730] [2022-11-20 10:47:27,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494731730] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:27,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280821077] [2022-11-20 10:47:27,687 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:47:27,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:27,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:27,688 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:27,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 10:47:27,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:47:27,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:47:27,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 10:47:27,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:28,056 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-11-20 10:47:28,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-11-20 10:47:28,073 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-20 10:47:28,090 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-20 10:47:28,105 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-20 10:47:28,591 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-20 10:47:28,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 100 [2022-11-20 10:47:28,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:28,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:47:28,698 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-20 10:47:28,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 53 [2022-11-20 10:47:29,004 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-11-20 10:47:29,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 31 [2022-11-20 10:47:29,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 10:47:29,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-20 10:47:29,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:29,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:29,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:29,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:29,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:29,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:29,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:29,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-11-20 10:47:29,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 10:47:29,845 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 17 treesize of output 9 [2022-11-20 10:47:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:29,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:47:29,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))) is different from false [2022-11-20 10:47:29,922 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_2034 1))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))) is different from false [2022-11-20 10:47:29,938 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2034 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))) is different from false [2022-11-20 10:47:29,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2034 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))) is different from false [2022-11-20 10:47:29,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2034 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_2032 1))))))) is different from false [2022-11-20 10:47:30,017 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2033 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2032 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))) is different from false [2022-11-20 10:47:30,058 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2032 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2022-11-20 10:47:30,108 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2034 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_2028 1))) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))) is different from false [2022-11-20 10:47:30,150 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2028 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))))))) is different from false [2022-11-20 10:47:30,211 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2032 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2028 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-20 10:47:30,280 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2034 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_2026 1))) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2032 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))) is different from false [2022-11-20 10:47:30,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2034 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2032 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2026 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))) is different from false [2022-11-20 10:47:30,426 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2034 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2032 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2026 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-20 10:47:30,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2023 Int) (v_ArrVal_2034 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2023)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_2023 1))) (< (+ v_ArrVal_2028 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2026 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2034 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))) is different from false [2022-11-20 10:47:30,608 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2023 Int) (v_ArrVal_2034 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2023)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2028 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2023 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2026 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2034 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))))) is different from false [2022-11-20 10:47:30,722 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2032 Int) (v_ArrVal_2023 Int) (v_ArrVal_2034 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2021))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2023)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2023 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2026 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)))))))))))))) is different from false [2022-11-20 10:47:30,853 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2032 Int) (v_ArrVal_2020 Int) (v_ArrVal_2023 Int) (v_ArrVal_2034 Int) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2020)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2021))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2023)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (not (<= |c_ULTIMATE.start_test_fun_#t~mem12#1| (+ v_ArrVal_2020 1))) (< (+ v_ArrVal_2026 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2034 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2023 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))))) is different from false [2022-11-20 10:47:30,953 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2032 Int) (v_ArrVal_2020 Int) (v_ArrVal_2023 Int) (v_ArrVal_2034 Int) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2020)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2021))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2023)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2026 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2020 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2023 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))))))) is different from false [2022-11-20 10:47:31,012 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_test_fun_#t~mem8#1| 0) (forall ((v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2032 Int) (v_ArrVal_2020 Int) (v_ArrVal_2023 Int) (v_ArrVal_2034 Int) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2020)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2021))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2023)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2026 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2020 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2034 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2023 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))))))))))) is different from false [2022-11-20 10:47:31,072 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (= .cse0 0) (forall ((v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2033 (Array Int Int)) (v_ArrVal_2021 (Array Int Int)) (v_ArrVal_2030 (Array Int Int)) (v_ArrVal_2032 Int) (v_ArrVal_2020 Int) (v_ArrVal_2023 Int) (v_ArrVal_2034 Int) (v_ArrVal_2026 Int) (v_ArrVal_2028 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2020)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2021))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2023)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2024))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2026)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2027))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2028)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2030))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2032)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2033))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (+ v_ArrVal_2026 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_2034)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_2036) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_2020 1) .cse0) (< (+ v_ArrVal_2034 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2023 1) (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2032 1) (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_2028 1) (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))))))))))))) is different from false [2022-11-20 10:47:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 150 not checked. [2022-11-20 10:47:31,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280821077] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:47:31,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:47:31,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19, 24] total 65 [2022-11-20 10:47:31,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951907563] [2022-11-20 10:47:31,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:47:31,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-20 10:47:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:31,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-20 10:47:31,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=1618, Unknown=20, NotChecked=2140, Total=4290 [2022-11-20 10:47:31,317 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand has 66 states, 65 states have (on average 2.5692307692307694) internal successors, (167), 66 states have internal predecessors, (167), 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-20 10:47:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:33,117 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-11-20 10:47:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 10:47:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.5692307692307694) internal successors, (167), 66 states have internal predecessors, (167), 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 57 [2022-11-20 10:47:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:33,119 INFO L225 Difference]: With dead ends: 121 [2022-11-20 10:47:33,119 INFO L226 Difference]: Without dead ends: 120 [2022-11-20 10:47:33,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 77 SyntacticMatches, 25 SemanticMatches, 73 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 1889 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=683, Invalid=2347, Unknown=20, NotChecked=2500, Total=5550 [2022-11-20 10:47:33,120 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:33,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 156 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 217 Invalid, 0 Unknown, 652 Unchecked, 0.2s Time] [2022-11-20 10:47:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-20 10:47:33,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 69. [2022-11-20 10:47:33,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.044776119402985) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:47:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-11-20 10:47:33,136 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 57 [2022-11-20 10:47:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:33,136 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-11-20 10:47:33,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.5692307692307694) internal successors, (167), 66 states have internal predecessors, (167), 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-20 10:47:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-11-20 10:47:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-20 10:47:33,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:33,137 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:33,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:33,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 10:47:33,338 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-11-20 10:47:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2070392642, now seen corresponding path program 5 times [2022-11-20 10:47:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:33,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786294264] [2022-11-20 10:47:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:34,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:34,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786294264] [2022-11-20 10:47:34,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786294264] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:34,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716003468] [2022-11-20 10:47:34,616 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:47:34,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:34,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:34,618 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:34,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0562fad3-2128-45af-9b1f-014b9676d6f5/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 10:47:34,879 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-11-20 10:47:34,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:47:34,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 10:47:34,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:35,012 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-20 10:47:35,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2022-11-20 10:47:35,124 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:35,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2022-11-20 10:47:35,320 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:35,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-11-20 10:47:35,522 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:35,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 44 [2022-11-20 10:47:35,723 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:35,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 48 [2022-11-20 10:47:35,905 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:35,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-11-20 10:47:36,113 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:36,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2022-11-20 10:47:36,314 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:36,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-11-20 10:47:36,530 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:36,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2022-11-20 10:47:36,730 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:36,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-11-20 10:47:36,954 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:36,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2022-11-20 10:47:37,135 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:37,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-11-20 10:47:37,360 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:37,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2022-11-20 10:47:37,537 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-11-20 10:47:37,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 46 [2022-11-20 10:47:37,584 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 17 treesize of output 9 [2022-11-20 10:47:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:47:37,588 INFO L328 TraceCheckSpWp]: Computing backward predicates...