./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/mods.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- 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 20:18:17,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:18:17,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:18:17,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:18:17,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:18:17,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:18:17,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:18:17,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:18:17,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:18:17,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:18:17,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:18:17,985 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:18:17,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:18:17,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:18:17,988 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:18:17,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:18:17,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:18:17,991 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:18:17,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:18:17,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:18:17,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:18:17,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:18:17,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:18:17,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:18:18,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:18:18,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:18:18,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:18:18,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:18:18,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:18:18,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:18:18,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:18:18,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:18:18,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:18:18,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:18:18,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:18:18,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:18:18,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:18:18,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:18:18,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:18:18,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:18:18,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:18:18,015 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 20:18:18,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:18:18,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:18:18,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:18:18,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:18:18,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:18:18,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:18:18,042 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:18:18,042 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:18:18,042 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:18:18,042 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:18:18,043 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:18:18,043 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:18:18,043 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:18:18,043 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:18:18,044 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:18:18,044 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:18:18,044 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:18:18,045 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:18:18,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:18:18,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:18:18,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:18:18,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:18:18,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:18:18,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:18:18,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:18:18,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:18:18,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:18:18,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:18:18,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:18:18,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:18:18,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:18:18,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:18:18,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:18:18,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:18:18,049 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:18:18,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:18:18,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:18:18,050 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:18:18,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:18:18,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:18:18,050 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:18:18,051 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_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/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_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2022-11-20 20:18:18,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:18:18,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:18:18,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:18:18,306 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:18:18,307 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:18:18,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/array-fpi/mods.c [2022-11-20 20:18:21,485 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:18:21,729 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:18:21,729 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/sv-benchmarks/c/array-fpi/mods.c [2022-11-20 20:18:21,736 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/data/03c3bc1e8/9b1b19f3052f41a6b6627e57352a4609/FLAG43c890993 [2022-11-20 20:18:21,756 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/data/03c3bc1e8/9b1b19f3052f41a6b6627e57352a4609 [2022-11-20 20:18:21,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:18:21,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:18:21,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:18:21,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:18:21,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:18:21,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:18:21" (1/1) ... [2022-11-20 20:18:21,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f69ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:21, skipping insertion in model container [2022-11-20 20:18:21,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:18:21" (1/1) ... [2022-11-20 20:18:21,780 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:18:21,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:18:22,002 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-20 20:18:22,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:18:22,057 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:18:22,074 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-20 20:18:22,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:18:22,110 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:18:22,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22 WrapperNode [2022-11-20 20:18:22,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:18:22,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:18:22,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:18:22,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:18:22,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,169 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-11-20 20:18:22,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:18:22,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:18:22,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:18:22,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:18:22,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,212 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:18:22,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:18:22,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:18:22,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:18:22,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (1/1) ... [2022-11-20 20:18:22,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:18:22,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:18:22,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:18:22,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:18:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:18:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:18:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:18:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:18:22,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:18:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:18:22,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:18:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:18:22,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:18:22,377 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:18:22,379 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:18:22,551 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:18:22,601 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:18:22,601 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 20:18:22,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:18:22 BoogieIcfgContainer [2022-11-20 20:18:22,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:18:22,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:18:22,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:18:22,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:18:22,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:18:21" (1/3) ... [2022-11-20 20:18:22,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ca7b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:18:22, skipping insertion in model container [2022-11-20 20:18:22,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:18:22" (2/3) ... [2022-11-20 20:18:22,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ca7b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:18:22, skipping insertion in model container [2022-11-20 20:18:22,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:18:22" (3/3) ... [2022-11-20 20:18:22,613 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2022-11-20 20:18:22,649 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:18:22,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 20:18:22,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:18:22,710 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b5726d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:18:22,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 20:18:22,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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 20:18:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:18:22,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:18:22,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:18:22,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:18:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:18:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1473824747, now seen corresponding path program 1 times [2022-11-20 20:18:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:18:22,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76858173] [2022-11-20 20:18:22,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:18:22,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:18:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:18:23,162 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 20:18:23,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:18:23,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76858173] [2022-11-20 20:18:23,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76858173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:18:23,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:18:23,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:18:23,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883112197] [2022-11-20 20:18:23,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:18:23,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:18:23,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:18:23,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:18:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:18:23,204 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 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 3.0) internal successors, (9), 3 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 20:18:23,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:18:23,269 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-11-20 20:18:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:18:23,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 20:18:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:18:23,281 INFO L225 Difference]: With dead ends: 24 [2022-11-20 20:18:23,281 INFO L226 Difference]: Without dead ends: 12 [2022-11-20 20:18:23,284 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 20:18:23,288 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:18:23,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 20:18:23,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-20 20:18:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-20 20:18:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 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 20:18:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-20 20:18:23,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-11-20 20:18:23,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:18:23,325 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-20 20:18:23,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 20:18:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-20 20:18:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 20:18:23,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:18:23,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:18:23,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:18:23,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:18:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:18:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash -332942029, now seen corresponding path program 1 times [2022-11-20 20:18:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:18:23,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391309365] [2022-11-20 20:18:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:18:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:18:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:18:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:18:23,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:18:23,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391309365] [2022-11-20 20:18:23,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391309365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:18:23,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:18:23,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:18:23,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380659516] [2022-11-20 20:18:23,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:18:23,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:18:23,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:18:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:18:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:18:23,558 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:18:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:18:23,650 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-11-20 20:18:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:18:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 20:18:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:18:23,653 INFO L225 Difference]: With dead ends: 27 [2022-11-20 20:18:23,654 INFO L226 Difference]: Without dead ends: 20 [2022-11-20 20:18:23,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:18:23,662 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:18:23,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 6 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:18:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-20 20:18:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-11-20 20:18:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 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 20:18:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-11-20 20:18:23,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2022-11-20 20:18:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:18:23,669 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-20 20:18:23,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:18:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-11-20 20:18:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:18:23,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:18:23,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:18:23,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:18:23,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:18:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:18:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1080912201, now seen corresponding path program 1 times [2022-11-20 20:18:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:18:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370776544] [2022-11-20 20:18:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:18:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:18:23,714 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:18:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497563313] [2022-11-20 20:18:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:18:23,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:18:23,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:18:23,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:18:23,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:18:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:18:23,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-20 20:18:23,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:18:23,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 20:18:24,011 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 20:18:24,065 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 19 treesize of output 18 [2022-11-20 20:18:24,151 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 39 treesize of output 26 [2022-11-20 20:18:24,229 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 36 treesize of output 23 [2022-11-20 20:18:24,338 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 84 treesize of output 51 [2022-11-20 20:18:24,492 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 53 treesize of output 29 [2022-11-20 20:18:24,517 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 20:18:24,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:19:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:19:26,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:19:26,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370776544] [2022-11-20 20:19:26,742 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:19:26,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497563313] [2022-11-20 20:19:26,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497563313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:19:26,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1108909963] [2022-11-20 20:19:26,764 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:19:26,764 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:19:26,768 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:19:26,774 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:19:26,775 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:19:26,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:26,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:26,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:26,931 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:19:26,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:19:26,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:26,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:26,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:19:26,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:26,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-20 20:19:27,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-20 20:19:27,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:27,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:27,361 INFO L321 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-20 20:19:27,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-20 20:19:27,495 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 16 treesize of output 12 [2022-11-20 20:19:27,547 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:19:27,547 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 29 [2022-11-20 20:19:27,654 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:19:27,656 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 26 treesize of output 54 [2022-11-20 20:19:27,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:27,741 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:19:27,745 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 31 treesize of output 34 [2022-11-20 20:19:27,848 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:19:27,849 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 31 treesize of output 54 [2022-11-20 20:19:27,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:28,195 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:19:28,195 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 130 treesize of output 73 [2022-11-20 20:19:28,391 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:19:28,391 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 130 treesize of output 93 [2022-11-20 20:19:28,469 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:19:29,477 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '235#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:19:29,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:19:29,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:19:29,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-11-20 20:19:29,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766908519] [2022-11-20 20:19:29,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:19:29,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 20:19:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:19:29,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 20:19:29,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=586, Unknown=24, NotChecked=0, Total=702 [2022-11-20 20:19:29,482 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:19:49,010 WARN L233 SmtUtils]: Spent 13.30s on a formula simplification. DAG size of input: 46 DAG size of output: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:19:51,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-20 20:19:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:19:52,955 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-11-20 20:19:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:19:52,956 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 20:19:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:19:52,957 INFO L225 Difference]: With dead ends: 31 [2022-11-20 20:19:52,957 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 20:19:52,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=134, Invalid=833, Unknown=25, NotChecked=0, Total=992 [2022-11-20 20:19:52,959 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:19:52,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 45 Unchecked, 3.1s Time] [2022-11-20 20:19:52,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 20:19:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-11-20 20:19:52,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 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 20:19:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2022-11-20 20:19:52,970 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 13 [2022-11-20 20:19:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:19:52,970 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2022-11-20 20:19:52,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:19:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2022-11-20 20:19:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 20:19:52,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:19:52,972 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:19:52,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:19:53,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:19:53,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:19:53,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:19:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1737417492, now seen corresponding path program 2 times [2022-11-20 20:19:53,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:19:53,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349126152] [2022-11-20 20:19:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:19:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:19:53,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:19:53,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [353612909] [2022-11-20 20:19:53,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:19:53,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:19:53,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:19:53,217 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:19:53,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:19:53,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:19:53,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:19:53,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:19:53,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:19:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:19:53,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:19:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:19:53,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:19:53,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349126152] [2022-11-20 20:19:53,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:19:53,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353612909] [2022-11-20 20:19:53,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353612909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:19:53,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656877787] [2022-11-20 20:19:53,393 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:19:53,393 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:19:53,393 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:19:53,394 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:19:53,394 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:19:53,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,442 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:19:53,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-20 20:19:53,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,551 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:19:53,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:19:53,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:19:53,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-20 20:19:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:53,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:53,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:53,851 INFO L321 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-20 20:19:53,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-20 20:19:53,973 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 16 treesize of output 12 [2022-11-20 20:19:54,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:54,044 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-20 20:19:54,045 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 26 treesize of output 34 [2022-11-20 20:19:54,125 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:19:54,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 26 treesize of output 54 [2022-11-20 20:19:54,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:54,177 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:19:54,177 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 31 treesize of output 34 [2022-11-20 20:19:54,254 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:19:54,254 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 31 treesize of output 54 [2022-11-20 20:19:54,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:54,354 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:19:54,355 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 100 treesize of output 68 [2022-11-20 20:19:54,594 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:19:54,594 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 130 treesize of output 93 [2022-11-20 20:19:54,660 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:19:55,241 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '429#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:19:55,241 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:19:55,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:19:55,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-20 20:19:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467843739] [2022-11-20 20:19:55,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:19:55,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 20:19:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:19:55,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 20:19:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-20 20:19:55,243 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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 20:19:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:19:55,398 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2022-11-20 20:19:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:19:55,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 20:19:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:19:55,400 INFO L225 Difference]: With dead ends: 61 [2022-11-20 20:19:55,400 INFO L226 Difference]: Without dead ends: 35 [2022-11-20 20:19:55,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-20 20:19:55,401 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:19:55,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 18 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:19:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-20 20:19:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2022-11-20 20:19:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 0 states have call successors, (0), 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 20:19:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-20 20:19:55,407 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 14 [2022-11-20 20:19:55,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:19:55,408 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-20 20:19:55,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 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 20:19:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-20 20:19:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:19:55,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:19:55,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:19:55,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:19:55,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:19:55,610 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:19:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:19:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash 996737740, now seen corresponding path program 3 times [2022-11-20 20:19:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:19:55,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137511932] [2022-11-20 20:19:55,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:19:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:19:55,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:19:55,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [134577089] [2022-11-20 20:19:55,655 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:19:55,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:19:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:19:55,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:19:55,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:19:55,736 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:19:55,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:19:55,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:19:55,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:19:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:19:55,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:19:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 20:19:55,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:19:55,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137511932] [2022-11-20 20:19:55,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:19:55,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134577089] [2022-11-20 20:19:55,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134577089] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:19:55,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650937652] [2022-11-20 20:19:55,829 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:19:55,829 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:19:55,830 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:19:55,830 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:19:55,830 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:19:55,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:55,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:55,944 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-20 20:19:55,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-20 20:19:55,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:55,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:55,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,048 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:19:56,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:19:56,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-20 20:19:56,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-20 20:19:56,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:56,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:56,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:56,324 INFO L321 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-20 20:19:56,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-20 20:19:56,539 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 16 treesize of output 12 [2022-11-20 20:19:56,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:56,583 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-20 20:19:56,584 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 26 treesize of output 34 [2022-11-20 20:19:56,659 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:19:56,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 54 [2022-11-20 20:19:56,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:56,725 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:19:56,725 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 31 treesize of output 34 [2022-11-20 20:19:56,810 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:19:56,810 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 31 treesize of output 54 [2022-11-20 20:19:56,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:57,080 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:19:57,080 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 100 treesize of output 68 [2022-11-20 20:19:57,283 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:19:57,283 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 130 treesize of output 93 [2022-11-20 20:19:57,344 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:19:57,835 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '668#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:19:57,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:19:57,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:19:57,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-20 20:19:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684558838] [2022-11-20 20:19:57,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:19:57,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 20:19:57,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:19:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 20:19:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-20 20:19:57,837 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 20:19:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:19:58,002 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-11-20 20:19:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:19:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 20:19:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:19:58,003 INFO L225 Difference]: With dead ends: 35 [2022-11-20 20:19:58,003 INFO L226 Difference]: Without dead ends: 29 [2022-11-20 20:19:58,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-11-20 20:19:58,005 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:19:58,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 18 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:19:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-20 20:19:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2022-11-20 20:19:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:19:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-11-20 20:19:58,011 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2022-11-20 20:19:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:19:58,012 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-11-20 20:19:58,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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 20:19:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-11-20 20:19:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:19:58,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:19:58,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:19:58,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:19:58,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:19:58,218 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:19:58,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:19:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1834853461, now seen corresponding path program 4 times [2022-11-20 20:19:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:19:58,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870853623] [2022-11-20 20:19:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:19:58,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:19:58,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:19:58,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762741052] [2022-11-20 20:19:58,244 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:19:58,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:19:58,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:19:58,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:19:58,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:19:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:19:58,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-20 20:19:58,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:19:58,357 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 20:19:58,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 20:19:58,388 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 19 treesize of output 18 [2022-11-20 20:19:58,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:58,417 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 28 treesize of output 30 [2022-11-20 20:19:58,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:58,514 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 0 case distinctions, treesize of input 48 treesize of output 38 [2022-11-20 20:19:58,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:58,571 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 0 case distinctions, treesize of input 54 treesize of output 38 [2022-11-20 20:19:58,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:58,680 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 0 case distinctions, treesize of input 57 treesize of output 37 [2022-11-20 20:19:58,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:58,739 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 0 case distinctions, treesize of input 63 treesize of output 41 [2022-11-20 20:19:58,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:19:58,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:58,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 371 treesize of output 177 [2022-11-20 20:19:59,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:19:59,022 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 0 case distinctions, treesize of input 57 treesize of output 41 [2022-11-20 20:19:59,159 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 53 treesize of output 29 [2022-11-20 20:19:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:19:59,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:20:02,106 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_186)))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ v_ArrVal_186 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (mod .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) 0) (not (<= (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_186))))) is different from false [2022-11-20 20:20:04,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_186 Int) (v_ArrVal_184 Int)) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse6 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (or (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_186)))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ v_ArrVal_186 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (mod .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) 0) (not (<= (+ (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_184)) (not (<= (+ v_ArrVal_184 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_184)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_186))))) is different from false [2022-11-20 20:21:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:21:18,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870853623] [2022-11-20 20:21:18,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:21:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762741052] [2022-11-20 20:21:18,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762741052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:21:18,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [834372714] [2022-11-20 20:21:18,730 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:21:18,730 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:21:18,731 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:21:18,731 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:21:18,731 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:21:18,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,781 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:21:18,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-20 20:21:18,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,903 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:21:18,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:21:18,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:21:18,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:18,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-20 20:21:19,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:19,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:19,193 INFO L321 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-20 20:21:19,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-20 20:21:19,294 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 16 treesize of output 12 [2022-11-20 20:21:19,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:19,343 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-20 20:21:19,344 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 26 treesize of output 34 [2022-11-20 20:21:19,432 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:21:19,433 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 26 treesize of output 54 [2022-11-20 20:21:19,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:19,507 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:21:19,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 34 [2022-11-20 20:21:19,595 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:21:19,595 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 31 treesize of output 54 [2022-11-20 20:21:19,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:19,900 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:21:19,900 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 100 treesize of output 68 [2022-11-20 20:21:20,292 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:21:20,293 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 130 treesize of output 93 [2022-11-20 20:21:20,352 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:21:21,438 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '895#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:21:21,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:21:21,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:21:21,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-11-20 20:21:21,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441989043] [2022-11-20 20:21:21,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:21:21,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 20:21:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:21,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 20:21:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=903, Unknown=31, NotChecked=126, Total=1190 [2022-11-20 20:21:21,441 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 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 20:21:23,489 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (let ((.cse11 (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse3 .cse11 (+ .cse4 (select .cse3 .cse11)))))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (let ((.cse0 (+ .cse4 .cse5))) (mod .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0))) (store .cse1 .cse2 (+ (select .cse3 .cse2) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) 0) (= (let ((.cse6 (let ((.cse8 (+ .cse10 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse7 .cse8 (+ (select .cse3 .cse8) .cse9))))) (mod (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) 0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 0 .cse4) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (mod (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ .cse9 1)) 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (mod .cse5 (+ .cse4 1)) 0))))) is different from false [2022-11-20 20:21:31,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:31,830 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-11-20 20:21:31,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 20:21:31,831 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 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 20:21:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:31,832 INFO L225 Difference]: With dead ends: 40 [2022-11-20 20:21:31,832 INFO L226 Difference]: Without dead ends: 38 [2022-11-20 20:21:31,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 90.3s TimeCoverageRelationStatistics Valid=168, Invalid=1216, Unknown=34, NotChecked=222, Total=1640 [2022-11-20 20:21:31,835 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:31,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 169 Invalid, 0 Unknown, 158 Unchecked, 0.6s Time] [2022-11-20 20:21:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-20 20:21:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-11-20 20:21:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 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 20:21:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-11-20 20:21:31,854 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 17 [2022-11-20 20:21:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:31,854 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-11-20 20:21:31,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 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 20:21:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-11-20 20:21:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:21:31,856 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:31,856 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:31,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:32,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:32,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:21:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1784474046, now seen corresponding path program 5 times [2022-11-20 20:21:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:32,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968884614] [2022-11-20 20:21:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:32,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:21:32,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2104481766] [2022-11-20 20:21:32,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:21:32,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:32,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:32,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:21:32,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:21:32,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:21:32,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:21:32,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 20:21:32,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 20:21:32,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:21:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 20:21:32,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:32,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968884614] [2022-11-20 20:21:32,329 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:21:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104481766] [2022-11-20 20:21:32,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104481766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:21:32,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [341282100] [2022-11-20 20:21:32,332 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:21:32,332 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:21:32,332 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:21:32,333 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:21:32,333 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:21:32,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,371 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:21:32,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-20 20:21:32,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,479 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:21:32,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:21:32,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:21:32,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-20 20:21:32,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:32,721 INFO L321 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-20 20:21:32,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-20 20:21:32,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-20 20:21:32,843 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:21:32,844 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 29 [2022-11-20 20:21:32,914 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:21:32,915 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 26 treesize of output 54 [2022-11-20 20:21:32,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:32,974 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:21:32,974 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 29 [2022-11-20 20:21:33,037 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:21:33,037 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 31 treesize of output 54 [2022-11-20 20:21:33,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:33,306 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:21:33,306 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 130 treesize of output 73 [2022-11-20 20:21:33,527 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:21:33,527 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 130 treesize of output 93 [2022-11-20 20:21:33,583 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:21:34,151 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1155#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:21:34,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:21:34,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:21:34,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-20 20:21:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374648271] [2022-11-20 20:21:34,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:21:34,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:21:34,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:34,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:21:34,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:21:34,153 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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 20:21:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:34,352 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-11-20 20:21:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:21:34,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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 20:21:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:34,356 INFO L225 Difference]: With dead ends: 82 [2022-11-20 20:21:34,356 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 20:21:34,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-11-20 20:21:34,357 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:34,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 30 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:21:34,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 20:21:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-11-20 20:21:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 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 20:21:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-11-20 20:21:34,368 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 18 [2022-11-20 20:21:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:34,368 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-11-20 20:21:34,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 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 20:21:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-11-20 20:21:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 20:21:34,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:34,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:34,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:34,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:34,570 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:21:34,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2144309898, now seen corresponding path program 6 times [2022-11-20 20:21:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:34,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087451559] [2022-11-20 20:21:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:34,598 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:21:34,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967702883] [2022-11-20 20:21:34,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:21:34,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:34,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:34,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:21:34,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:21:34,690 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:21:34,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:21:34,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 20:21:34,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 20:21:34,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:21:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 20:21:34,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087451559] [2022-11-20 20:21:34,847 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:21:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967702883] [2022-11-20 20:21:34,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967702883] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:21:34,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1281733624] [2022-11-20 20:21:34,850 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:21:34,850 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:21:34,850 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:21:34,850 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:21:34,851 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:21:34,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:34,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:34,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:34,989 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:21:34,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:21:35,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:21:35,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-20 20:21:35,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-20 20:21:35,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:35,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:35,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:35,311 INFO L321 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-20 20:21:35,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-20 20:21:35,497 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 16 treesize of output 12 [2022-11-20 20:21:35,546 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:21:35,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-20 20:21:35,618 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:21:35,618 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 26 treesize of output 54 [2022-11-20 20:21:35,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:35,686 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:21:35,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-20 20:21:35,770 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:21:35,771 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 31 treesize of output 54 [2022-11-20 20:21:35,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:35,842 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:21:35,842 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 130 treesize of output 73 [2022-11-20 20:21:36,157 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:21:36,158 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 130 treesize of output 93 [2022-11-20 20:21:36,216 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:21:36,839 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1492#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:21:36,839 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:21:36,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:21:36,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-20 20:21:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302062021] [2022-11-20 20:21:36,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:21:36,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:21:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:36,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:21:36,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:21:36,841 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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 20:21:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:37,105 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-11-20 20:21:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:21:37,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-20 20:21:37,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:37,106 INFO L225 Difference]: With dead ends: 72 [2022-11-20 20:21:37,106 INFO L226 Difference]: Without dead ends: 54 [2022-11-20 20:21:37,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2022-11-20 20:21:37,108 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:37,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 49 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:21:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-20 20:21:37,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2022-11-20 20:21:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-11-20 20:21:37,118 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 19 [2022-11-20 20:21:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:37,118 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-11-20 20:21:37,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 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 20:21:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-11-20 20:21:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:21:37,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:37,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:37,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:21:37,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:37,324 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:21:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash -65478855, now seen corresponding path program 1 times [2022-11-20 20:21:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:37,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634614401] [2022-11-20 20:21:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:37,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:37,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:21:37,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [559986807] [2022-11-20 20:21:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:21:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:37,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:21:37,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:21:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:37,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-20 20:21:37,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:21:37,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-20 20:21:37,502 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 20:21:37,529 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 19 treesize of output 18 [2022-11-20 20:21:37,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:37,557 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 28 treesize of output 30 [2022-11-20 20:21:37,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:37,636 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 0 case distinctions, treesize of input 48 treesize of output 38 [2022-11-20 20:21:37,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:37,683 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 0 case distinctions, treesize of input 50 treesize of output 38 [2022-11-20 20:21:37,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:37,773 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 0 case distinctions, treesize of input 53 treesize of output 37 [2022-11-20 20:21:37,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:37,820 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 0 case distinctions, treesize of input 55 treesize of output 37 [2022-11-20 20:21:37,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:21:37,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:37,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 85 [2022-11-20 20:21:38,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:21:38,011 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 0 case distinctions, treesize of input 156 treesize of output 84 [2022-11-20 20:21:38,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 41 [2022-11-20 20:21:38,496 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 20:21:38,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:21:42,524 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse46 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse19 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (select .cse11 .cse12)) (.cse45 (+ .cse19 1)) (.cse8 (+ .cse46 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select .cse11 .cse8)) (.cse31 (< .cse45 0)) (.cse20 (mod .cse44 .cse45))) (let ((.cse32 (< .cse44 0)) (.cse0 (= .cse20 0)) (.cse1 (not .cse31)) (.cse2 (not (< .cse10 0))) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (or .cse0 (and (or .cse1 (let ((.cse5 (+ .cse19 .cse20 1))) (and (or .cse2 (and (forall ((v_ArrVal_361 Int)) (let ((.cse7 (store .cse11 .cse12 v_ArrVal_361))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse6 (mod .cse10 (+ .cse9 1)))) (let ((.cse3 (store .cse7 .cse8 (+ .cse6 (- 1) (* (- 1) .cse9))))) (or (= 0 (select .cse3 .cse4)) (not (<= .cse5 v_ArrVal_361)) (< 0 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse6 0))))))) (forall ((v_ArrVal_361 Int)) (let ((.cse15 (store .cse11 .cse12 v_ArrVal_361))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (mod .cse10 (+ .cse16 1)))) (let ((.cse13 (store .cse15 .cse8 (+ .cse14 .cse16 1)))) (or (< 0 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse13 .cse4) 0) (not (<= .cse5 v_ArrVal_361)) (= .cse14 0))))))))) (forall ((v_ArrVal_361 Int)) (let ((.cse17 (let ((.cse18 (store .cse11 .cse12 v_ArrVal_361))) (store .cse18 .cse8 (mod .cse10 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or (= (select .cse17 .cse4) 0) (< 0 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= .cse5 v_ArrVal_361)))))))) (or (and (forall ((v_ArrVal_361 Int)) (let ((.cse21 (let ((.cse22 (store .cse11 .cse12 v_ArrVal_361))) (store .cse22 .cse8 (mod .cse10 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or (= (select .cse21 .cse4) 0) (< 0 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= .cse20 (+ v_ArrVal_361 .cse19 1)))))) (or .cse2 (and (forall ((v_ArrVal_361 Int)) (let ((.cse25 (store .cse11 .cse12 v_ArrVal_361))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse24 (mod .cse10 (+ .cse26 1)))) (let ((.cse23 (store .cse25 .cse8 (+ .cse24 (- 1) (* (- 1) .cse26))))) (or (= 0 (select .cse23 .cse4)) (< 0 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse24 0) (not (<= .cse20 (+ v_ArrVal_361 .cse19 1))))))))) (forall ((v_ArrVal_361 Int)) (let ((.cse29 (store .cse11 .cse12 v_ArrVal_361))) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (mod .cse10 (+ .cse30 1)))) (let ((.cse27 (store .cse29 .cse8 (+ .cse28 .cse30 1)))) (or (< 0 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse27 .cse4) 0) (= .cse28 0) (not (<= .cse20 (+ v_ArrVal_361 .cse19 1)))))))))))) .cse31)) (not .cse32)) (or (and .cse32 (not .cse0)) (let ((.cse33 (and (or (and (forall ((v_ArrVal_361 Int)) (let ((.cse36 (store .cse11 .cse12 v_ArrVal_361))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (mod .cse10 (+ .cse37 1)))) (let ((.cse34 (store .cse36 .cse8 (+ .cse35 (- 1) (* (- 1) .cse37))))) (or (= 0 (select .cse34 .cse4)) (< 0 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= .cse35 0) (not (<= .cse20 v_ArrVal_361)))))))) (forall ((v_ArrVal_361 Int)) (let ((.cse40 (store .cse11 .cse12 v_ArrVal_361))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse40) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse39 (mod .cse10 (+ .cse41 1)))) (let ((.cse38 (store .cse40 .cse8 (+ .cse39 .cse41 1)))) (or (< 0 (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select .cse38 .cse4) 0) (= .cse39 0) (not (<= .cse20 v_ArrVal_361))))))))) .cse2) (forall ((v_ArrVal_361 Int)) (let ((.cse42 (let ((.cse43 (store .cse11 .cse12 v_ArrVal_361))) (store .cse43 .cse8 (mod .cse10 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse43) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or (= (select .cse42 .cse4) 0) (< 0 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= .cse20 v_ArrVal_361)))))))) (and (or .cse33 .cse31) (or .cse33 .cse1)))))))))) is different from true [2022-11-20 20:23:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:23:42,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:23:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634614401] [2022-11-20 20:23:42,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:23:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559986807] [2022-11-20 20:23:42,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559986807] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:23:42,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206762255] [2022-11-20 20:23:42,584 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-20 20:23:42,585 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:23:42,585 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:23:42,585 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:23:42,585 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:23:42,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,741 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-20 20:23:42,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-20 20:23:42,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,891 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:23:42,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:23:42,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-20 20:23:42,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:42,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-20 20:23:43,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:43,233 INFO L321 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-20 20:23:43,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-20 20:23:43,324 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 16 treesize of output 12 [2022-11-20 20:23:43,342 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:43,384 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-20 20:23:43,384 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 26 treesize of output 34 [2022-11-20 20:23:43,475 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:23:43,476 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 26 treesize of output 54 [2022-11-20 20:23:43,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:43,556 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:23:43,556 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 29 [2022-11-20 20:23:43,640 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:23:43,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 2 case distinctions, treesize of input 31 treesize of output 54 [2022-11-20 20:23:43,796 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:23:43,797 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 100 treesize of output 68 [2022-11-20 20:23:44,039 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:23:44,040 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 130 treesize of output 93 [2022-11-20 20:23:44,152 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:24:43,336 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1843#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:24:43,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:24:43,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:24:43,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-11-20 20:24:43,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317744410] [2022-11-20 20:24:43,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:24:43,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:24:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:24:43,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:24:43,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1325, Unknown=31, NotChecked=76, Total=1640 [2022-11-20 20:24:43,338 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:24:55,915 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-11-20 20:24:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 20:24:55,916 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 20:24:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:24:55,916 INFO L225 Difference]: With dead ends: 41 [2022-11-20 20:24:55,916 INFO L226 Difference]: Without dead ends: 25 [2022-11-20 20:24:55,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 188.2s TimeCoverageRelationStatistics Valid=240, Invalid=1537, Unknown=33, NotChecked=82, Total=1892 [2022-11-20 20:24:55,918 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:24:55,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 116 Invalid, 0 Unknown, 122 Unchecked, 0.3s Time] [2022-11-20 20:24:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-20 20:24:55,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-11-20 20:24:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 20:24:55,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-20 20:24:55,925 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2022-11-20 20:24:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:24:55,926 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-20 20:24:55,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-20 20:24:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-20 20:24:55,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:24:55,927 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:24:55,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:24:56,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 20:24:56,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:24:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:24:56,134 INFO L85 PathProgramCache]: Analyzing trace with hash -105264649, now seen corresponding path program 7 times [2022-11-20 20:24:56,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:24:56,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976721869] [2022-11-20 20:24:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:24:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:24:56,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:24:56,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [63941105] [2022-11-20 20:24:56,156 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:24:56,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:24:56,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:24:56,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:24:56,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:24:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:56,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-20 20:24:56,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:24:56,298 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 20:24:56,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 20:24:56,326 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 24 treesize of output 23 [2022-11-20 20:24:56,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,370 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 28 treesize of output 30 [2022-11-20 20:24:56,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-20 20:24:56,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:56,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2022-11-20 20:24:56,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:56,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2022-11-20 20:24:56,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 49 [2022-11-20 20:24:56,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:56,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2022-11-20 20:24:56,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:56,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-20 20:24:57,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:57,051 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 0 case distinctions, treesize of input 57 treesize of output 39 [2022-11-20 20:24:57,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:57,206 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 0 case distinctions, treesize of input 47 treesize of output 37 [2022-11-20 20:24:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:57,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:57,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-11-20 20:24:57,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:57,421 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 0 case distinctions, treesize of input 37 treesize of output 33 [2022-11-20 20:24:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:24:57,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:09,362 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_446 Int)) (= (let ((.cse9 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ .cse5 .cse6 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse7))) (mod .cse0 (+ 1 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_446)) (.cse3 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))))) 0)) is different from false [2022-11-20 20:25:11,471 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_446 Int)) (= (let ((.cse10 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7 .cse8))))) (let ((.cse4 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (+ .cse5 .cse6 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse7 .cse8))) (mod .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_446)) (.cse3 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse4 .cse3))))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))))))) 0)) is different from false [2022-11-20 20:25:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-20 20:25:37,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:37,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976721869] [2022-11-20 20:25:37,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:25:37,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63941105] [2022-11-20 20:25:37,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63941105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:37,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [625346111] [2022-11-20 20:25:37,625 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:25:37,625 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:25:37,626 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:25:37,626 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:25:37,626 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:25:37,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,759 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:25:37,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:25:37,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:25:37,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 25 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 98 [2022-11-20 20:25:37,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2022-11-20 20:25:37,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:37,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:37,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:38,025 INFO L321 Elim1Store]: treesize reduction 166, result has 11.7 percent of original size [2022-11-20 20:25:38,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 34 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 22 case distinctions, treesize of input 434 treesize of output 423 [2022-11-20 20:25:38,127 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 16 treesize of output 12 [2022-11-20 20:25:38,180 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:25:38,180 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 29 [2022-11-20 20:25:38,288 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:25:38,288 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 26 treesize of output 54 [2022-11-20 20:25:38,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:38,377 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:25:38,377 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 29 [2022-11-20 20:25:38,487 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:25:38,487 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 31 treesize of output 54 [2022-11-20 20:25:38,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:38,825 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:25:38,825 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 130 treesize of output 73 [2022-11-20 20:25:39,013 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:25:39,013 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 130 treesize of output 93 [2022-11-20 20:25:39,065 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:25:41,520 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2124#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:25:41,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:25:41,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:25:41,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-11-20 20:25:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901217084] [2022-11-20 20:25:41,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:41,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 20:25:41,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:41,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 20:25:41,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1447, Unknown=10, NotChecked=158, Total=1806 [2022-11-20 20:25:41,524 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:29,434 WARN L233 SmtUtils]: Spent 19.61s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:27:19,744 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:27:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:27:56,598 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-11-20 20:27:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-20 20:27:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-20 20:27:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:27:56,601 INFO L225 Difference]: With dead ends: 63 [2022-11-20 20:27:56,601 INFO L226 Difference]: Without dead ends: 61 [2022-11-20 20:27:56,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 177.4s TimeCoverageRelationStatistics Valid=269, Invalid=2158, Unknown=31, NotChecked=194, Total=2652 [2022-11-20 20:27:56,603 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:27:56,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 45 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 172 Invalid, 0 Unknown, 400 Unchecked, 0.3s Time] [2022-11-20 20:27:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-20 20:27:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-11-20 20:27:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 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 20:27:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2022-11-20 20:27:56,620 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 21 [2022-11-20 20:27:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:27:56,620 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2022-11-20 20:27:56,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-11-20 20:27:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 20:27:56,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:27:56,622 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:27:56,628 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:27:56,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:56,823 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:27:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:27:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1837045100, now seen corresponding path program 8 times [2022-11-20 20:27:56,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:27:56,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332060767] [2022-11-20 20:27:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:27:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:27:56,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:27:56,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150854434] [2022-11-20 20:27:56,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:27:56,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:56,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:27:56,844 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:27:56,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 20:27:57,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:27:57,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:27:57,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 20:27:57,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 20:27:57,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 20:27:57,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:27:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332060767] [2022-11-20 20:27:57,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:27:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150854434] [2022-11-20 20:27:57,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150854434] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:27:57,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [531001537] [2022-11-20 20:27:57,260 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:27:57,260 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:27:57,260 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:27:57,261 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:27:57,261 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:27:57,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,304 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:27:57,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-20 20:27:57,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,433 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:27:57,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:27:57,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2022-11-20 20:27:57,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-20 20:27:57,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:57,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:27:57,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:27:57,678 INFO L321 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-20 20:27:57,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-20 20:27:57,774 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 16 treesize of output 12 [2022-11-20 20:27:57,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:27:57,863 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:27:57,863 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 29 [2022-11-20 20:27:57,971 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:27:57,971 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 26 treesize of output 54 [2022-11-20 20:27:58,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:27:58,057 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:27:58,057 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 29 [2022-11-20 20:27:58,148 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:27:58,149 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 31 treesize of output 54 [2022-11-20 20:27:58,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:27:58,251 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:27:58,252 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 130 treesize of output 73 [2022-11-20 20:27:58,750 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:27:58,750 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 130 treesize of output 93 [2022-11-20 20:27:58,803 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:27:59,756 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2508#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:27:59,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:27:59,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:27:59,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-20 20:27:59,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297470933] [2022-11-20 20:27:59,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:27:59,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 20:27:59,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:27:59,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 20:27:59,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-20 20:27:59,759 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:28:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:28:00,356 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2022-11-20 20:28:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:28:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 20:28:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:28:00,357 INFO L225 Difference]: With dead ends: 113 [2022-11-20 20:28:00,358 INFO L226 Difference]: Without dead ends: 90 [2022-11-20 20:28:00,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 18 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2022-11-20 20:28:00,359 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:28:00,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 106 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:28:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-20 20:28:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 43. [2022-11-20 20:28:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:28:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-11-20 20:28:00,378 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 22 [2022-11-20 20:28:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:28:00,379 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-11-20 20:28:00,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:28:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-11-20 20:28:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:28:00,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:28:00,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:28:00,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:28:00,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:28:00,580 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:28:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:28:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash -807483306, now seen corresponding path program 9 times [2022-11-20 20:28:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:28:00,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550920282] [2022-11-20 20:28:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:28:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:28:00,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:28:00,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081927623] [2022-11-20 20:28:00,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:28:00,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:28:00,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:28:00,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:28:00,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 20:28:00,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:28:00,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:28:00,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 20:28:00,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:28:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 20:28:00,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:28:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 20:28:00,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:28:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550920282] [2022-11-20 20:28:00,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 20:28:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081927623] [2022-11-20 20:28:00,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081927623] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:28:00,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1705031724] [2022-11-20 20:28:00,928 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-20 20:28:00,928 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 20:28:00,929 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 20:28:00,929 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 20:28:00,929 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 20:28:00,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:00,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,074 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-20 20:28:01,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 57 [2022-11-20 20:28:01,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,115 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:28:01,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 23 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 102 [2022-11-20 20:28:01,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,247 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-20 20:28:01,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 69 [2022-11-20 20:28:01,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 30 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 108 [2022-11-20 20:28:01,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:01,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:28:01,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:28:01,459 INFO L321 Elim1Store]: treesize reduction 154, result has 18.5 percent of original size [2022-11-20 20:28:01,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 27 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 429 treesize of output 424 [2022-11-20 20:28:01,600 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 16 treesize of output 12 [2022-11-20 20:28:01,651 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:28:01,652 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 29 [2022-11-20 20:28:01,733 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-20 20:28:01,734 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 26 treesize of output 54 [2022-11-20 20:28:01,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:28:01,801 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-20 20:28:01,801 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 29 [2022-11-20 20:28:01,895 INFO L321 Elim1Store]: treesize reduction 24, result has 62.5 percent of original size [2022-11-20 20:28:01,895 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 31 treesize of output 54 [2022-11-20 20:28:02,006 INFO L321 Elim1Store]: treesize reduction 53, result has 27.4 percent of original size [2022-11-20 20:28:02,011 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 100 treesize of output 68 [2022-11-20 20:28:02,409 INFO L321 Elim1Store]: treesize reduction 63, result has 38.8 percent of original size [2022-11-20 20:28:02,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 93 [2022-11-20 20:28:02,456 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 20:28:03,289 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2946#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= |ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main_#t~mem17#1| 0) 1 0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))) |ULTIMATE.start_main_#t~mem17#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~#sum~0#1.base|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 20:28:03,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 20:28:03,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:28:03,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-20 20:28:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876316627] [2022-11-20 20:28:03,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 20:28:03,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 20:28:03,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:28:03,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 20:28:03,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2022-11-20 20:28:03,292 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:28:03,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:28:03,581 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-11-20 20:28:03,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 20:28:03,582 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 20:28:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:28:03,583 INFO L225 Difference]: With dead ends: 93 [2022-11-20 20:28:03,583 INFO L226 Difference]: Without dead ends: 71 [2022-11-20 20:28:03,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-11-20 20:28:03,584 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:28:03,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 45 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:28:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-20 20:28:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2022-11-20 20:28:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:28:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-11-20 20:28:03,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-11-20 20:28:03,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:28:03,604 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-11-20 20:28:03,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:28:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-11-20 20:28:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 20:28:03,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:28:03,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:28:03,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:28:03,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 20:28:03,816 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 20:28:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:28:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -607830675, now seen corresponding path program 2 times [2022-11-20 20:28:03,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:28:03,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203622598] [2022-11-20 20:28:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:28:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:28:03,844 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 20:28:03,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399661576] [2022-11-20 20:28:03,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:28:03,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:28:03,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:28:03,846 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:28:03,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13cd4e4b-3a15-4be2-aa6d-502182ad31e6/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 20:28:04,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:28:04,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:28:04,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 20:28:04,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:28:04,176 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 16 treesize of output 12 [2022-11-20 20:28:04,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,207 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 21 treesize of output 20 [2022-11-20 20:28:04,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-20 20:28:04,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-20 20:28:04,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-20 20:28:04,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-11-20 20:28:04,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2022-11-20 20:28:04,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2022-11-20 20:28:04,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:04,911 INFO L321 Elim1Store]: treesize reduction 22, result has 59.3 percent of original size [2022-11-20 20:28:04,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 81 [2022-11-20 20:28:05,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 304 treesize of output 177 [2022-11-20 20:28:05,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:05,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 150 [2022-11-20 20:28:06,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:06,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:06,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:06,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:06,942 INFO L321 Elim1Store]: treesize reduction 50, result has 61.5 percent of original size [2022-11-20 20:28:06,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 380 treesize of output 248 [2022-11-20 20:28:14,268 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select .cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse11 (< 0 c_~N~0)) (.cse12 (<= |c_ULTIMATE.start_main_~i~0#1| 1))) (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse0 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (not (= 8 .cse0)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse2 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse4 (mod .cse3 .cse3))) (and (= (select .cse1 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3) (= .cse4 .cse5) (= (select .cse1 (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse4 .cse3)) (= .cse6 .cse4))))) (not (= .cse2 .cse0)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))))))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_374| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse8 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (+ .cse8 1))) (let ((.cse9 (mod .cse10 .cse10))) (and (= (+ .cse8 .cse5 1) (mod .cse9 .cse10)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse10) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (< .cse9 0) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|) (= .cse6 .cse9)))))) .cse11 .cse12) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse13 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (not (= 8 .cse13)) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse14 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse15 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse16 (mod .cse15 .cse15))) (and (= (select .cse1 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse15) (exists ((v_arrayElimCell_641 Int)) (and (not (< v_arrayElimCell_641 0)) (= (select .cse1 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_641 .cse15)))) (= .cse16 .cse5) (< .cse15 0) (= .cse6 .cse16))))) (not (= .cse14 .cse13)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (not (= .cse13 0))))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse18 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse20 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse17 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse21 (mod .cse17 .cse17))) (and (not (< .cse17 0)) (exists ((v_arrayElimCell_641 Int)) (let ((.cse19 (mod v_arrayElimCell_641 .cse17))) (and (= (select .cse1 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse19) (= 0 .cse19)))) (= (select .cse1 (+ .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse17) (= .cse21 .cse5) (= .cse6 .cse21))))) (not (= .cse20 .cse18)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))) (not (= 8 .cse18)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (not (= .cse18 0))))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse25 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse22 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse26 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse23 (+ .cse26 1))) (let ((.cse24 (mod .cse23 .cse23))) (and (= (select .cse1 (+ .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse23) (= .cse24 .cse5) (< .cse24 0) (= (mod .cse24 .cse23) (+ (select .cse1 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse26 1)) (= .cse6 .cse24)))))) (not (= .cse22 .cse25)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))) (not (= 8 .cse25)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse27 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse31 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse28 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (+ .cse28 1))) (let ((.cse32 (mod .cse30 .cse30))) (and (exists ((v_arrayElimCell_641 Int)) (let ((.cse29 (mod v_arrayElimCell_641 .cse30))) (and (= (select .cse1 (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ .cse28 1 .cse29)) (not (= 0 .cse29)) (< v_arrayElimCell_641 0)))) (= (select .cse1 (+ .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse30) (= .cse32 .cse5) (< .cse30 0) (= .cse6 .cse32)))))) (not (= .cse31 .cse27)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))) (not (= 8 .cse27)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (not (= .cse27 0))))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse35 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse34 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse36 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (+ .cse36 1))) (let ((.cse38 (mod .cse33 .cse33))) (and (not (< .cse33 0)) (= (select .cse1 (+ .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse33) (exists ((v_arrayElimCell_641 Int)) (let ((.cse37 (mod v_arrayElimCell_641 .cse33))) (and (= (+ (select .cse1 (+ .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse36 1) .cse37) (not (= 0 .cse37)) (< v_arrayElimCell_641 0)))) (= .cse38 .cse5) (= .cse6 .cse38)))))) (not (= .cse34 .cse35)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))) (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (not (= 8 .cse35)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (not (= .cse35 0))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse40 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse39 (mod .cse40 .cse40))) (and (= .cse39 (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_383|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse40) (= .cse39 .cse5) (= .cse39 .cse40) (= .cse6 .cse39))))) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse43 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse42 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse41 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse44 (mod .cse41 .cse41))) (and (not (< .cse41 0)) (= (select .cse1 (+ .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse41) (exists ((v_arrayElimCell_641 Int)) (and (not (< v_arrayElimCell_641 0)) (= (select .cse1 (+ .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod v_arrayElimCell_641 .cse41)))) (= .cse44 .cse5) (= .cse6 .cse44))))) (not (= .cse42 .cse43)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))) (not (= 8 .cse43)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (not (= .cse43 0))))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_374| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse45 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse46 (mod .cse45 .cse45))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse45) (= (mod .cse46 .cse45) .cse5) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|) (= .cse6 .cse46))))) .cse11 .cse12) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse47 (+ |v_ULTIMATE.start_main_~i~0#1_383| 1))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (<= c_~N~0 .cse47) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse48 (let ((.cse49 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (mod .cse49 .cse49)))) (and (= .cse48 (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_383|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (= .cse48 .cse5) (= .cse6 .cse48)))) (<= |c_ULTIMATE.start_main_~i~0#1| .cse47) (<= 2 |v_ULTIMATE.start_main_~i~0#1_383|)))))) (and .cse11 (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse50 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (+ .cse50 1))) (let ((.cse51 (mod .cse52 .cse52))) (and (= (+ .cse50 .cse5 1) (mod .cse51 .cse52)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse52) (< .cse51 0) (= .cse6 .cse51)))))) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse53 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse54 (mod .cse53 .cse53))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse53) (= (mod .cse54 .cse53) .cse5) (= .cse6 .cse54))))) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))))) .cse12) (and (or (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse55 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse56 (mod .cse55 .cse55))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse55) (= .cse56 .cse5) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|) (= .cse56 .cse55) (= .cse6 .cse56))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse58 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse57 (mod .cse58 .cse58))) (and (= .cse6 (mod .cse57 .cse58)) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse58) (= .cse57 .cse5))))) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse61 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (+ .cse61 1))) (let ((.cse60 (mod .cse59 .cse59))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse59) (= .cse60 .cse5) (< .cse60 0) (= (mod .cse60 .cse59) (+ .cse6 .cse61 1))))))) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|)))) (< 1 c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse63 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse64 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse62 (mod .cse64 .cse64))) (and (= .cse62 (select .cse1 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse64) (= .cse62 .cse5) (= .cse62 .cse64) (= .cse6 .cse62))))) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (not (= .cse63 0))))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse65 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|)) (.cse68 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse69 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse66 (+ .cse69 1))) (let ((.cse67 (mod .cse66 .cse66))) (and (= (select .cse1 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse66) (= .cse67 .cse5) (< .cse67 0) (= (mod .cse67 .cse66) (+ (select .cse1 (+ .cse68 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse69 1)) (= .cse6 .cse67)))))) (not (= .cse65 .cse68)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (and (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int)) (let ((.cse70 (* 8 |v_ULTIMATE.start_main_~i~0#1_374|)) (.cse73 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse71 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse72 (mod .cse71 .cse71))) (and (= (select .cse1 (+ .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse71) (= .cse72 .cse5) (= (select .cse1 (+ .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|)) (mod .cse72 .cse71)) (= .cse6 .cse72))))) (not (= .cse70 .cse73)) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|)))))))) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_383| Int)) (let ((.cse75 (* 8 |v_ULTIMATE.start_main_~i~0#1_383|))) (and (exists ((|v_ULTIMATE.start_main_~i~0#1_374| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse76 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse74 (mod .cse76 .cse76))) (and (= .cse74 (select .cse1 (+ .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|))) (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse76) (= .cse74 .cse5) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|) (= .cse6 .cse74))))) (< |v_ULTIMATE.start_main_~i~0#1_383| c_~N~0) (not (= 8 .cse75)) (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_383| 1)) (not (= .cse75 0))))) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_374| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse77 (+ (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse78 (mod .cse77 .cse77))) (and (= (select .cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_374|) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse77) (= .cse78 .cse5) (<= .cse7 |ULTIMATE.start_main_~#sum~0#1.base|) (< |v_ULTIMATE.start_main_~i~0#1_374| c_~N~0) (<= c_~N~0 (+ |v_ULTIMATE.start_main_~i~0#1_374| 1)) (<= 2 |v_ULTIMATE.start_main_~i~0#1_374|) (= .cse78 .cse77) (= .cse6 .cse78))))) .cse11 .cse12)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-11-20 20:28:17,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:17,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:17,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:28:17,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 47 [2022-11-20 20:28:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-11-20 20:28:17,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:28:46,088 WARN L233 SmtUtils]: Spent 21.46s on a formula simplification. DAG size of input: 195 DAG size of output: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:28:53,067 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse106 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse39 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (+ .cse106 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (+ .cse106 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse35 (select .cse36 .cse16)) (.cse104 (select .cse36 .cse37)) (.cse105 (+ .cse39 1))) (let ((.cse38 (mod .cse104 .cse105)) (.cse34 (< .cse35 0)) (.cse40 (< .cse105 0))) (let ((.cse41 (not .cse40)) (.cse19 (not .cse34)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse72 (< .cse104 0)) (.cse0 (= .cse38 0))) (and (or .cse0 (and (or (let ((.cse15 (store .cse36 .cse37 (+ (- 1) .cse38 (* (- 1) .cse39))))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse18 (mod .cse35 (+ .cse17 1)))) (let ((.cse20 (= .cse18 0))) (and (or (let ((.cse5 (store .cse15 .cse16 (+ .cse17 .cse18 1)))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (+ .cse7 1))) (and (forall ((v_subst_3 Int)) (let ((.cse6 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select .cse5 .cse6))) (let ((.cse4 (mod .cse1 .cse8))) (let ((.cse2 (store .cse5 .cse6 (+ (- 1) .cse4 (* (- 1) .cse7))))) (or (not (< .cse1 0)) (= (select .cse2 .cse3) 0) (= .cse4 0) (not (< v_subst_3 c_~N~0)) (< (+ v_subst_3 1) c_~N~0) (not (= 0 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))))))))) (forall ((v_subst_2 Int)) (let ((.cse11 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select .cse5 .cse11))) (let ((.cse9 (store .cse5 .cse11 (mod .cse10 .cse8)))) (or (= (select .cse9 .cse3) 0) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (< .cse10 0) (not (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_1 Int)) (let ((.cse14 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (mod (select .cse5 .cse14) .cse8))) (let ((.cse13 (store .cse5 .cse14 .cse12))) (or (not (< v_subst_1 c_~N~0)) (not (= 0 .cse12)) (= (select .cse13 .cse3) 0) (< (+ v_subst_1 1) c_~N~0) (not (= (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))))))) .cse19 .cse20) (or (let ((.cse23 (store .cse15 .cse16 .cse18))) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (+ .cse30 1))) (and (forall ((v_subst_2 Int)) (let ((.cse24 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (select .cse23 .cse24))) (let ((.cse22 (store .cse23 .cse24 (mod .cse21 .cse25)))) (or (< .cse21 0) (not (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (= (select .cse22 .cse3) 0)))))) (forall ((v_subst_3 Int)) (let ((.cse29 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (select .cse23 .cse29))) (let ((.cse27 (mod .cse26 .cse25))) (let ((.cse28 (store .cse23 .cse29 (+ (- 1) (* .cse30 (- 1)) .cse27)))) (or (not (< v_subst_3 c_~N~0)) (not (< .cse26 0)) (= .cse27 0) (not (= (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse28 .cse3) 0) (< (+ v_subst_3 1) c_~N~0))))))) (forall ((v_subst_1 Int)) (let ((.cse33 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (mod (select .cse23 .cse33) .cse25))) (let ((.cse32 (store .cse23 .cse33 .cse31))) (or (not (= .cse31 0)) (not (< v_subst_1 c_~N~0)) (= (select .cse32 .cse3) 0) (< (+ v_subst_1 1) c_~N~0) (not (= (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))))))) (and (not .cse20) .cse34))))))) .cse40) (or .cse41 (let ((.cse56 (store .cse36 .cse37 (+ .cse39 .cse38 1)))) (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse57 (mod .cse35 (+ .cse58 1)))) (let ((.cse42 (= .cse57 0))) (and (or .cse42 .cse19 (let ((.cse45 (store .cse56 .cse16 (+ .cse57 .cse58 1)))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse47 (+ .cse55 1))) (and (forall ((v_subst_1 Int)) (let ((.cse46 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (mod (select .cse45 .cse46) .cse47))) (let ((.cse43 (store .cse45 .cse46 .cse44))) (or (not (< v_subst_1 c_~N~0)) (= (select .cse43 .cse3) 0) (< (+ v_subst_1 1) c_~N~0) (not (= .cse44 0)) (not (= (select .cse43 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_2 Int)) (let ((.cse50 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse49 (select .cse45 .cse50))) (let ((.cse48 (store .cse45 .cse50 (mod .cse49 .cse47)))) (or (= (select .cse48 .cse3) 0) (< .cse49 0) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (not (= (select .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_3 Int)) (let ((.cse54 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (select .cse45 .cse54))) (let ((.cse51 (mod .cse52 .cse47))) (let ((.cse53 (store .cse45 .cse54 (+ (- 1) (* (- 1) .cse55) .cse51)))) (or (= .cse51 0) (not (< v_subst_3 c_~N~0)) (not (< .cse52 0)) (not (= (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse53 .cse3) 0) (< (+ v_subst_3 1) c_~N~0)))))))))))) (or (and (not .cse42) .cse34) (let ((.cse62 (store .cse56 .cse16 .cse57))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse65 (+ .cse64 1))) (and (forall ((v_subst_3 Int)) (let ((.cse63 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse60 (select .cse62 .cse63))) (let ((.cse61 (mod .cse60 .cse65))) (let ((.cse59 (store .cse62 .cse63 (+ (- 1) (* (- 1) .cse64) .cse61)))) (or (not (= (select .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse60 0)) (= .cse61 0) (not (< v_subst_3 c_~N~0)) (= (select .cse59 .cse3) 0) (< (+ v_subst_3 1) c_~N~0))))))) (forall ((v_subst_2 Int)) (let ((.cse68 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse66 (select .cse62 .cse68))) (let ((.cse67 (store .cse62 .cse68 (mod .cse66 .cse65)))) (or (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (< .cse66 0) (= (select .cse67 .cse3) 0) (not (= (select .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (forall ((v_subst_1 Int)) (let ((.cse71 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse70 (mod (select .cse62 .cse71) .cse65))) (let ((.cse69 (store .cse62 .cse71 .cse70))) (or (not (= (select .cse69 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< v_subst_1 c_~N~0)) (not (= .cse70 0)) (< (+ v_subst_1 1) c_~N~0) (= (select .cse69 .cse3) 0)))))))))))))))))) (not .cse72)) (or (let ((.cse73 (let ((.cse88 (store .cse36 .cse37 .cse38))) (let ((.cse89 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse88) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse90 (mod .cse35 (+ .cse89 1)))) (let ((.cse74 (= .cse90 0))) (and (or .cse19 .cse74 (let ((.cse77 (store .cse88 .cse16 (+ .cse89 .cse90 1)))) (let ((.cse87 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse77) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse79 (+ .cse87 1))) (and (forall ((v_subst_1 Int)) (let ((.cse78 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse76 (mod (select .cse77 .cse78) .cse79))) (let ((.cse75 (store .cse77 .cse78 .cse76))) (or (not (= (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< v_subst_1 c_~N~0)) (not (= .cse76 0)) (= (select .cse75 .cse3) 0) (< (+ v_subst_1 1) c_~N~0)))))) (forall ((v_subst_2 Int)) (let ((.cse82 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse80 (select .cse77 .cse82))) (let ((.cse81 (store .cse77 .cse82 (mod .cse80 .cse79)))) (or (< (+ v_subst_2 1) c_~N~0) (< .cse80 0) (not (< v_subst_2 c_~N~0)) (not (= (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse81 .cse3) 0)))))) (forall ((v_subst_3 Int)) (let ((.cse86 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse85 (select .cse77 .cse86))) (let ((.cse83 (mod .cse85 .cse79))) (let ((.cse84 (store .cse77 .cse86 (+ (- 1) .cse83 (* (- 1) .cse87))))) (or (= .cse83 0) (not (< v_subst_3 c_~N~0)) (not (= (select .cse84 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse84 .cse3) 0) (not (< .cse85 0)) (< (+ v_subst_3 1) c_~N~0)))))))))))) (or (let ((.cse94 (store .cse88 .cse16 .cse90))) (let ((.cse96 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse94) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse97 (+ .cse96 1))) (and (forall ((v_subst_3 Int)) (let ((.cse95 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse91 (select .cse94 .cse95))) (let ((.cse93 (mod .cse91 .cse97))) (let ((.cse92 (store .cse94 .cse95 (+ (- 1) (* (- 1) .cse96) .cse93)))) (or (not (< .cse91 0)) (not (= (select .cse92 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= (select .cse92 .cse3) 0) (not (< v_subst_3 c_~N~0)) (= .cse93 0) (< (+ v_subst_3 1) c_~N~0))))))) (forall ((v_subst_1 Int)) (let ((.cse100 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse98 (mod (select .cse94 .cse100) .cse97))) (let ((.cse99 (store .cse94 .cse100 .cse98))) (or (not (= .cse98 0)) (not (< v_subst_1 c_~N~0)) (= (select .cse99 .cse3) 0) (not (= (select .cse99 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< (+ v_subst_1 1) c_~N~0)))))) (forall ((v_subst_2 Int)) (let ((.cse103 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse101 (select .cse94 .cse103))) (let ((.cse102 (store .cse94 .cse103 (mod .cse101 .cse97)))) (or (< .cse101 0) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (not (= (select .cse102 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= 0 (select .cse102 .cse3))))))))))) (and .cse34 (not .cse74)))))))))) (and (or .cse73 .cse40) (or .cse73 .cse41))) (and .cse72 (not .cse0))))))))) (not (< 1 c_~N~0))) is different from true [2022-11-20 20:29:03,286 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 159 DAG size of output: 114 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:29:09,843 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse11 (let ((.cse39 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse40 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse39 .cse40 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse39 .cse40)))))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int)) (let ((.cse10 (let ((.cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse12 (+ .cse13 (select .cse11 .cse12)))))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (mod (select .cse10 .cse7) (+ .cse9 1)))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_392|)) (forall ((v_subst_3 Int)) (let ((.cse3 (store .cse6 .cse7 (+ .cse8 .cse9 1))) (.cse4 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select .cse3 .cse4)) (.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (mod .cse2 (+ .cse5 1)))) (or (= .cse1 0) (not (< .cse2 0)) (not (< v_subst_3 c_~N~0)) (not (= (select (store .cse3 .cse4 (+ (- 1) .cse1 (* (- 1) .cse5))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< (+ v_subst_3 1) c_~N~0)))))) (= .cse8 0))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int)) (let ((.cse21 (let ((.cse22 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse22 (+ .cse13 (select .cse11 .cse22)))))) (let ((.cse18 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse20 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse19 (mod (select .cse21 .cse7) (+ .cse20 1)))) (or (forall ((v_subst_1 Int)) (let ((.cse17 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (store .cse18 .cse7 (+ .cse19 .cse20 1)))) (let ((.cse14 (mod (select .cse16 .cse17) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse16) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (let ((.cse15 (store .cse16 .cse17 .cse14))) (or (not (< v_subst_1 c_~N~0)) (not (= .cse14 0)) (< (+ v_subst_1 1) c_~N~0) (= (select .cse15 .cse7) 0) (not (= (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_392|)) (= .cse19 0))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int)) (let ((.cse28 (let ((.cse29 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse29 (+ .cse13 (select .cse11 .cse29)))))) (let ((.cse27 (store .cse28 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse23 (mod (select .cse28 .cse7) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse23 0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (forall ((v_subst_2 Int)) (let ((.cse24 (let ((.cse26 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse25 (store .cse27 .cse7 .cse23))) (store .cse25 .cse26 (mod (select .cse25 .cse26) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))))) (or (not (= (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< (+ v_subst_2 1) c_~N~0) (= 0 (select .cse24 .cse7))))) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_392|))))))) (forall ((|v_ULTIMATE.start_main_~i~0#1_392| Int)) (let ((.cse37 (let ((.cse38 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse38 (+ .cse13 (select .cse11 .cse38)))))) (let ((.cse34 (store .cse37 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse37 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse35 (mod (select .cse37 .cse7) (+ .cse36 1)))) (or (forall ((v_subst_2 Int)) (let ((.cse32 (store .cse34 .cse7 (+ .cse35 .cse36 1))) (.cse33 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (select .cse32 .cse33))) (let ((.cse31 (store .cse32 .cse33 (mod .cse30 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (or (< .cse30 0) (= (select .cse31 .cse7) 0) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (not (= (select .cse31 |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (not (<= .cse0 |v_ULTIMATE.start_main_~i~0#1_392|)) (= .cse35 0)))))))))) (not (< 1 c_~N~0))) is different from true [2022-11-20 20:29:38,411 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:29:58,909 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (and (forall ((v_ArrVal_661 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_661)))) (let ((.cse10 (let ((.cse11 (let ((.cse14 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_661 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse13 .cse7 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse14 .cse7)))))) (.cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse12 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse12)))))) (let ((.cse6 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse8 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (mod (select .cse10 .cse7) (+ .cse8 1)))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (forall ((v_subst_3 Int)) (let ((.cse1 (store .cse6 .cse7 (+ .cse8 .cse9 1))) (.cse2 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select .cse1 .cse2)) (.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (mod .cse4 (+ .cse3 1)))) (or (= .cse0 0) (not (= (select (store .cse1 .cse2 (+ (- 1) .cse0 (* (- 1) .cse3))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< v_subst_3 c_~N~0)) (not (< .cse4 0)) (< (+ v_subst_3 1) c_~N~0)))))) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= .cse9 0)))))))) (forall ((v_ArrVal_661 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int)) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_661)))) (let ((.cse23 (let ((.cse24 (let ((.cse27 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_661 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse26 .cse7 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse27 .cse7)))))) (.cse25 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse24 .cse25 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse24 .cse25)))))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (mod (select .cse23 .cse7) (+ .cse22 1)))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= .cse16 0) (forall ((v_subst_2 Int)) (let ((.cse18 (store .cse21 .cse7 (+ .cse22 .cse16 1))) (.cse19 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse17 (select .cse18 .cse19))) (or (< .cse17 0) (< (+ v_subst_2 1) c_~N~0) (not (< v_subst_2 c_~N~0)) (not (= (select (store .cse18 .cse19 (mod .cse17 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))))))))))) (forall ((v_ArrVal_661 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_661)))) (let ((.cse35 (let ((.cse36 (let ((.cse39 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_661 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse38 .cse7 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse39 .cse7)))))) (.cse37 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse36 .cse37 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse36 .cse37)))))) (let ((.cse32 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse33 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (mod (select .cse35 .cse7) (+ .cse33 1)))) (or (forall ((v_subst_1 Int)) (let ((.cse30 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse29 (store .cse32 .cse7 (+ .cse33 .cse34 1)))) (let ((.cse28 (mod (select .cse29 .cse30) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (< v_subst_1 c_~N~0)) (not (= .cse28 0)) (not (= (select (store .cse29 .cse30 .cse28) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< (+ v_subst_1 1) c_~N~0))))) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (= .cse34 0)))))))))) is different from false [2022-11-20 20:29:59,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:29:59,681 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 1 case distinctions, treesize of input 14798 treesize of output 11639 [2022-11-20 20:30:00,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:30:00,107 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 1 case distinctions, treesize of input 12052 treesize of output 9481 [2022-11-20 20:30:00,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:30:00,791 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 1 case distinctions, treesize of input 20281 treesize of output 15949 [2022-11-20 20:30:03,281 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (let ((.cse9 (let ((.cse12 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse11 .cse6 (+ (select .cse12 .cse6) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse10 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse9 .cse10 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (mod (select .cse8 .cse6) (+ .cse7 1)))) (let ((.cse1 (store .cse5 .cse6 (+ .cse7 .cse4 1))) (.cse2 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (< (+ v_subst_2 1) c_~N~0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (< .cse0 0) (not (< v_subst_2 c_~N~0)) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (not (= (select (store .cse1 .cse2 (mod .cse0 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= .cse4 0)))))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_1 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse20 (let ((.cse21 (let ((.cse24 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse23 (store .cse24 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse24 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse23 .cse6 (+ (select .cse24 .cse6) (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse22 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse21 .cse22 (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse21 .cse22)))))) (let ((.cse18 (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse19 (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (mod (select .cse20 .cse6) (+ .cse19 1)))) (let ((.cse15 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse14 (store .cse18 .cse6 (+ .cse19 .cse16 1)))) (let ((.cse13 (mod (select .cse14 .cse15) (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (< v_subst_1 c_~N~0)) (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= .cse13 0)) (not (= (select (store .cse14 .cse15 .cse13) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= .cse16 0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (< (+ v_subst_1 1) c_~N~0)))))))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_3 Int)) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse34 (let ((.cse35 (let ((.cse38 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse37 (store .cse38 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse38 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse37 .cse6 (+ (select .cse38 .cse6) (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse36 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse35 .cse36 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse36)))))) (let ((.cse32 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse33 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse32) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (mod (select .cse34 .cse6) (+ .cse33 1)))) (let ((.cse28 (store .cse32 .cse6 (+ .cse33 .cse25 1))) (.cse29 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse27 (select .cse28 .cse29)) (.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse26 (mod .cse27 (+ .cse30 1)))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_392| 1) c_~N~0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (= .cse25 0) (not (< v_subst_3 c_~N~0)) (= .cse26 0) (not (< |v_ULTIMATE.start_main_~i~0#1_392| c_~N~0)) (not (< .cse27 0)) (< (+ v_subst_3 1) c_~N~0) (not (= 0 (select (store .cse28 .cse29 (+ (- 1) (* (- 1) .cse30) .cse26)) |c_ULTIMATE.start_main_~a~0#1.offset|))))))))))))))) is different from false [2022-11-20 20:30:52,220 WARN L233 SmtUtils]: Spent 19.78s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:30:57,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (and (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_3 Int)) (let ((.cse6 (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse10 (let ((.cse11 (let ((.cse14 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse13 .cse8 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse13) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse14 .cse8)))))) (.cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse12 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse11 .cse12)))))) (let ((.cse7 (store .cse10 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse5 (mod (select .cse10 .cse8) (+ .cse9 1)))) (let ((.cse0 (store .cse7 .cse8 (+ .cse9 .cse5 1))) (.cse1 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (select .cse0 .cse1)) (.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (mod .cse4 (+ .cse3 1)))) (or (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_3) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_392|) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= (select (store .cse0 .cse1 (+ (- 1) .cse2 (* (- 1) .cse3))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= .cse2 0) (not (< .cse4 0)) (= .cse5 0) (< v_subst_3 |c_ULTIMATE.start_main_~i~0#1|))))))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_1 Int)) (let ((.cse20 (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse23 (let ((.cse24 (let ((.cse27 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse26 (store .cse27 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse26 .cse8 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse26) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse27 .cse8)))))) (.cse25 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse24 .cse25 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse24) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse24 .cse25)))))) (let ((.cse21 (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (mod (select .cse23 .cse8) (+ .cse22 1)))) (let ((.cse19 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (store .cse21 .cse8 (+ .cse17 .cse22 1)))) (let ((.cse16 (mod (select .cse18 .cse19) (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse16 0)) (= .cse17 0) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_392|) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_1) (< v_subst_1 |c_ULTIMATE.start_main_~i~0#1|) (not (= (select (store .cse18 .cse19 .cse16) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_392| |c_ULTIMATE.start_main_~i~0#1|)))))))))) (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int)) (let ((.cse31 (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (let ((.cse35 (let ((.cse37 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (let ((.cse39 (select .cse31 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse38 (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse38 .cse8 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse38) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse39 .cse8))))))) (store .cse36 .cse37 (+ (select .cse36 .cse37) (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse33 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse35) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse34 (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (mod (select .cse35 .cse8) (+ .cse34 1)))) (let ((.cse29 (store .cse33 .cse8 (+ .cse32 .cse34 1))) (.cse30 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (select .cse29 .cse30))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (< .cse28 0) (< |c_ULTIMATE.start_main_~i~0#1| v_subst_2) (not (= (select (store .cse29 .cse30 (mod .cse28 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~a~0#1.base| .cse29) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= .cse32 0) (< |v_ULTIMATE.start_main_~i~0#1_392| |c_ULTIMATE.start_main_~i~0#1|)))))))))))) is different from false [2022-11-20 20:31:05,032 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_400| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_400|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (let ((.cse9 (let ((.cse12 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse11 .cse6 (+ (select .cse12 .cse6) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse10 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse9 .cse10 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 1 (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (mod (select .cse8 .cse6) (+ .cse7 1)))) (let ((.cse0 (store .cse5 .cse6 (+ .cse4 .cse7 1))) (.cse1 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select .cse0 .cse1))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (< |v_ULTIMATE.start_main_~i~0#1_400| v_subst_2) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_400|) (not (= (select (store .cse0 .cse1 (mod .cse2 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= .cse4 0) (< .cse2 0)))))))))) (not (<= .cse14 |v_ULTIMATE.start_main_~i~0#1_400|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_400| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_1 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_400|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse22 (let ((.cse24 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (let ((.cse26 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse25 .cse6 (+ (select .cse26 .cse6) (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse23 .cse24 (+ (select .cse23 .cse24) (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse20 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse21 (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (mod (select .cse22 .cse6) (+ .cse21 1)))) (let ((.cse18 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (store .cse20 .cse6 (+ .cse21 1 .cse16)))) (let ((.cse15 (mod (select .cse17 .cse18) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse15 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (= 0 .cse16) (< |v_ULTIMATE.start_main_~i~0#1_400| v_subst_1) (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_400|) (< |v_ULTIMATE.start_main_~i~0#1_400| |v_ULTIMATE.start_main_~i~0#1_392|) (not (= (select (store .cse17 .cse18 .cse15) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_400|)))))))))) (not (<= .cse14 |v_ULTIMATE.start_main_~i~0#1_400|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_400| Int)) (or (not (<= .cse14 |v_ULTIMATE.start_main_~i~0#1_400|)) (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_3 Int)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_400|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse36 (let ((.cse38 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (let ((.cse40 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse39 .cse6 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse6))))))) (store .cse37 .cse38 (+ (select .cse37 .cse38) (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse34 (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse35 (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (mod (select .cse36 .cse6) (+ .cse35 1)))) (let ((.cse28 (store .cse34 .cse6 (+ .cse32 .cse35 1))) (.cse29 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (select .cse28 .cse29)) (.cse30 (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (mod .cse31 (+ .cse30 1)))) (or (= .cse27 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_3) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= (select (store .cse28 .cse29 (+ (- 1) (* (- 1) .cse30) .cse27)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse31 0)) (< |v_ULTIMATE.start_main_~i~0#1_400| |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse32 0) (< v_subst_3 |v_ULTIMATE.start_main_~i~0#1_400|))))))))))))))) is different from false [2022-11-20 20:31:07,045 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_400| Int)) (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_2 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_400|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_2))) (let ((.cse8 (let ((.cse9 (let ((.cse12 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select v_arrayElimArr_2 |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse11 .cse6 (+ (select .cse12 .cse6) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse10 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse9 .cse10 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse9 .cse10)))))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ 1 (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse4 (mod (select .cse8 .cse6) (+ .cse7 1)))) (let ((.cse0 (store .cse5 .cse6 (+ .cse4 .cse7 1))) (.cse1 (+ (* 8 v_subst_2) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse2 (select .cse0 .cse1))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (< v_subst_2 |v_ULTIMATE.start_main_~i~0#1_392|) (< |v_ULTIMATE.start_main_~i~0#1_400| v_subst_2) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_400|) (not (= (select (store .cse0 .cse1 (mod .cse2 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (= .cse4 0) (< .cse2 0)))))))))) (not (<= .cse14 |v_ULTIMATE.start_main_~i~0#1_400|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_400| Int)) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_1 Int)) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_400|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse22 (let ((.cse24 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse23 (let ((.cse26 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse25 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse25 .cse6 (+ (select .cse26 .cse6) (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse25) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse23 .cse24 (+ (select .cse23 .cse24) (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse23) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse20 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse22) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse21 (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (mod (select .cse22 .cse6) (+ .cse21 1)))) (let ((.cse18 (+ (* 8 v_subst_1) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (store .cse20 .cse6 (+ .cse21 1 .cse16)))) (let ((.cse15 (mod (select .cse17 .cse18) (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse15 0)) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (= 0 .cse16) (< |v_ULTIMATE.start_main_~i~0#1_400| v_subst_1) (< v_subst_1 |v_ULTIMATE.start_main_~i~0#1_400|) (< |v_ULTIMATE.start_main_~i~0#1_400| |v_ULTIMATE.start_main_~i~0#1_392|) (not (= (select (store .cse17 .cse18 .cse15) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (< |v_ULTIMATE.start_main_~i~0#1_392| |v_ULTIMATE.start_main_~i~0#1_400|)))))))))) (not (<= .cse14 |v_ULTIMATE.start_main_~i~0#1_400|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_400| Int)) (or (not (<= .cse14 |v_ULTIMATE.start_main_~i~0#1_400|)) (forall ((v_arrayElimArr_3 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_392| Int) (v_subst_3 Int)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_400|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_3))) (let ((.cse36 (let ((.cse38 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_392|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (let ((.cse40 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_arrayElimArr_3 |ULTIMATE.start_main_~#sum~0#1.offset|))))) (store .cse39 .cse6 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse39) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse40 .cse6))))))) (store .cse37 .cse38 (+ (select .cse37 .cse38) (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse37) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|)))))) (let ((.cse34 (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (let ((.cse35 (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse32 (mod (select .cse36 .cse6) (+ .cse35 1)))) (let ((.cse28 (store .cse34 .cse6 (+ .cse32 .cse35 1))) (.cse29 (+ (* 8 v_subst_3) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse31 (select .cse28 .cse29)) (.cse30 (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse28) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse27 (mod .cse31 (+ .cse30 1)))) (or (= .cse27 0) (< |v_ULTIMATE.start_main_~i~0#1_392| v_subst_3) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_392|)) (not (= (select (store .cse28 .cse29 (+ (- 1) (* (- 1) .cse30) .cse27)) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (< .cse31 0)) (< |v_ULTIMATE.start_main_~i~0#1_400| |v_ULTIMATE.start_main_~i~0#1_392|) (= .cse32 0) (< v_subst_3 |v_ULTIMATE.start_main_~i~0#1_400|))))))))))))))) is different from true [2022-11-20 20:31:08,290 INFO L321 Elim1Store]: treesize reduction 63, result has 37.6 percent of original size [2022-11-20 20:31:08,290 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 3 case distinctions, treesize of input 40766 treesize of output 12318 [2022-11-20 20:31:08,435 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 164591 treesize of output 148585 [2022-11-20 20:31:10,736 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~#sum~0#1.offset|) [2022-11-20 20:31:11,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:31:11,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:31:11,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:31:11,866 INFO L190 IndexEqualityManager]: detected not equals via solver