./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/s1if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-fpi/s1if.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur --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 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb --- 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-38b53e6 [2022-11-26 01:10:07,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:10:07,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:10:07,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:10:07,962 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:10:07,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:10:07,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:10:07,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:10:07,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:10:07,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:10:07,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:10:07,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:10:07,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:10:07,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:10:07,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:10:07,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:10:07,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:10:07,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:10:07,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:10:07,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:10:07,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:10:07,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:10:07,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:10:08,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:10:08,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:10:08,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:10:08,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:10:08,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:10:08,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:10:08,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:10:08,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:10:08,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:10:08,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:10:08,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:10:08,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:10:08,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:10:08,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:10:08,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:10:08,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:10:08,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:10:08,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:10:08,030 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 01:10:08,072 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:10:08,072 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:10:08,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:10:08,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:10:08,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:10:08,074 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:10:08,074 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:10:08,074 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:10:08,075 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:10:08,075 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:10:08,076 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:10:08,076 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:10:08,076 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:10:08,077 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:10:08,077 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:10:08,077 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:10:08,077 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:10:08,077 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:10:08,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:10:08,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 01:10:08,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:10:08,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 01:10:08,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:10:08,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 01:10:08,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:10:08,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 01:10:08,080 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 01:10:08,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 01:10:08,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:10:08,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 01:10:08,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:10:08,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:10:08,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:10:08,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:10:08,082 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:10:08,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:10:08,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 01:10:08,082 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:10:08,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:10:08,083 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 01:10:08,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:10:08,084 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_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/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_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur 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 -> 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb [2022-11-26 01:10:08,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:10:08,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:10:08,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:10:08,418 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:10:08,418 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:10:08,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-fpi/s1if.c [2022-11-26 01:10:11,401 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:10:11,596 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:10:11,596 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/sv-benchmarks/c/array-fpi/s1if.c [2022-11-26 01:10:11,604 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/data/c8dc43882/0cfed3e0352145eb825e41f6f0329156/FLAGe988c7020 [2022-11-26 01:10:11,628 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/data/c8dc43882/0cfed3e0352145eb825e41f6f0329156 [2022-11-26 01:10:11,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:10:11,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:10:11,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:10:11,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:10:11,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:10:11,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:11,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772b700b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11, skipping insertion in model container [2022-11-26 01:10:11,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:11,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:10:11,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:10:11,896 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_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/sv-benchmarks/c/array-fpi/s1if.c[587,600] [2022-11-26 01:10:11,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:10:11,925 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:10:11,938 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_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/sv-benchmarks/c/array-fpi/s1if.c[587,600] [2022-11-26 01:10:11,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:10:11,960 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:10:11,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11 WrapperNode [2022-11-26 01:10:11,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:10:11,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:10:11,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:10:11,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:10:11,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:11,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,004 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2022-11-26 01:10:12,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:10:12,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:10:12,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:10:12,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:10:12,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,053 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:10:12,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:10:12,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:10:12,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:10:12,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (1/1) ... [2022-11-26 01:10:12,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:10:12,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:12,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:10:12,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:10:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:10:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 01:10:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:10:12,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 01:10:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:10:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:10:12,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:10:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 01:10:12,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:10:12,231 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:10:12,233 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:10:12,398 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:10:12,463 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:10:12,463 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 01:10:12,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:12 BoogieIcfgContainer [2022-11-26 01:10:12,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:10:12,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:10:12,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:10:12,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:10:12,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:10:11" (1/3) ... [2022-11-26 01:10:12,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680c247a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:10:12, skipping insertion in model container [2022-11-26 01:10:12,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:10:11" (2/3) ... [2022-11-26 01:10:12,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680c247a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:10:12, skipping insertion in model container [2022-11-26 01:10:12,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:12" (3/3) ... [2022-11-26 01:10:12,476 INFO L112 eAbstractionObserver]: Analyzing ICFG s1if.c [2022-11-26 01:10:12,502 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:10:12,502 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 01:10:12,547 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:10:12,555 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;@1d93c7c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:10:12,555 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 01:10:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 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-26 01:10:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 01:10:12,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:12,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 01:10:12,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1569409207, now seen corresponding path program 1 times [2022-11-26 01:10:12,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:12,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756205314] [2022-11-26 01:10:12,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:12,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:12,976 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-26 01:10:12,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:12,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756205314] [2022-11-26 01:10:12,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756205314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:12,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:12,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:10:12,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184440385] [2022-11-26 01:10:12,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:12,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:10:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:10:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:10:13,017 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:13,060 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-11-26 01:10:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:10:13,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 01:10:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:13,072 INFO L225 Difference]: With dead ends: 18 [2022-11-26 01:10:13,072 INFO L226 Difference]: Without dead ends: 8 [2022-11-26 01:10:13,075 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-26 01:10:13,081 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:13,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:10:13,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-11-26 01:10:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-11-26 01:10:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-11-26 01:10:13,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-11-26 01:10:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:13,119 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-11-26 01:10:13,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-11-26 01:10:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 01:10:13,120 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:13,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:13,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:10:13,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1413550180, now seen corresponding path program 1 times [2022-11-26 01:10:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:13,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358652023] [2022-11-26 01:10:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:13,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:13,232 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-26 01:10:13,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:13,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358652023] [2022-11-26 01:10:13,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358652023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:10:13,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:10:13,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:10:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323300249] [2022-11-26 01:10:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:10:13,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:10:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:10:13,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:10:13,236 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:13,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:13,268 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-11-26 01:10:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:10:13,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-26 01:10:13,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:13,271 INFO L225 Difference]: With dead ends: 12 [2022-11-26 01:10:13,271 INFO L226 Difference]: Without dead ends: 9 [2022-11-26 01:10:13,271 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-26 01:10:13,273 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:13,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:10:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-26 01:10:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-26 01:10:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-11-26 01:10:13,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2022-11-26 01:10:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:13,278 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-11-26 01:10:13,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-11-26 01:10:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:10:13,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:13,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:13,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:10:13,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash -870274037, now seen corresponding path program 1 times [2022-11-26 01:10:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:13,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845016051] [2022-11-26 01:10:13,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:13,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:13,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:13,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464171760] [2022-11-26 01:10:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:13,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:13,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:13,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:13,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:10:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:13,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-26 01:10:13,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:13,589 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-26 01:10:13,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:13,670 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-26 01:10:13,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:13,830 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-26 01:10:13,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:13,962 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 39 treesize of output 23 [2022-11-26 01:10:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:13,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:14,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:10:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:14,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845016051] [2022-11-26 01:10:14,271 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:14,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464171760] [2022-11-26 01:10:14,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464171760] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:14,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1295182630] [2022-11-26 01:10:14,291 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:14,291 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:14,295 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:14,301 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:14,302 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:14,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,478 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:14,479 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-26 01:10:14,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,510 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-26 01:10:14,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,567 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-26 01:10:14,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,655 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-26 01:10:14,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:14,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:14,982 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:10:14,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:10:15,144 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-26 01:10:15,200 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:15,200 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 30 treesize of output 33 [2022-11-26 01:10:15,266 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:15,267 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 29 treesize of output 32 [2022-11-26 01:10:15,367 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:15,368 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 40 treesize of output 58 [2022-11-26 01:10:15,455 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:15,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-26 01:10:15,496 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:15,973 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '138#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:15,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:15,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:15,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-26 01:10:15,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987695420] [2022-11-26 01:10:15,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:15,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 01:10:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 01:10:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-11-26 01:10:15,977 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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-26 01:10:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:16,152 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-26 01:10:16,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:10:16,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 01:10:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:16,154 INFO L225 Difference]: With dead ends: 15 [2022-11-26 01:10:16,154 INFO L226 Difference]: Without dead ends: 12 [2022-11-26 01:10:16,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-11-26 01:10:16,156 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:16,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:16,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-26 01:10:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-26 01:10:16,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 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-26 01:10:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-11-26 01:10:16,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2022-11-26 01:10:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:16,163 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-11-26 01:10:16,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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-26 01:10:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-11-26 01:10:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:10:16,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:16,164 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:16,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:16,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:16,371 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1208582788, now seen corresponding path program 2 times [2022-11-26 01:10:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:16,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214300664] [2022-11-26 01:10:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:16,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:16,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:16,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378765338] [2022-11-26 01:10:16,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:10:16,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:16,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:16,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:16,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:10:16,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-26 01:10:16,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:10:16,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:10:16,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:16,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:16,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:16,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:16,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214300664] [2022-11-26 01:10:16,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:16,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378765338] [2022-11-26 01:10:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378765338] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:16,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [323310634] [2022-11-26 01:10:16,584 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:16,584 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:16,585 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:16,585 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:16,585 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:16,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,689 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:10:16,689 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-26 01:10:16,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,809 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:16,809 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-26 01:10:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,836 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-26 01:10:16,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:16,892 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-26 01:10:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:17,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:17,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:17,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:17,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:17,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:17,138 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:10:17,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:10:17,388 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-26 01:10:17,437 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:17,438 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 30 treesize of output 33 [2022-11-26 01:10:17,489 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:17,489 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 29 treesize of output 32 [2022-11-26 01:10:17,576 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:17,577 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 39 treesize of output 57 [2022-11-26 01:10:17,637 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:17,637 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 40 treesize of output 58 [2022-11-26 01:10:17,693 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:18,096 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '239#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:18,096 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:18,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:18,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-11-26 01:10:18,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427976090] [2022-11-26 01:10:18,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:18,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 01:10:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:18,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 01:10:18,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-26 01:10:18,098 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 01:10:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:18,175 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-11-26 01:10:18,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 01:10:18,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 01:10:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:18,176 INFO L225 Difference]: With dead ends: 20 [2022-11-26 01:10:18,176 INFO L226 Difference]: Without dead ends: 14 [2022-11-26 01:10:18,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-26 01:10:18,177 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:18,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:10:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-26 01:10:18,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2022-11-26 01:10:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 01:10:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-11-26 01:10:18,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2022-11-26 01:10:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:18,182 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-11-26 01:10:18,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 01:10:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-11-26 01:10:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 01:10:18,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:18,183 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:18,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:18,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:18,389 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:18,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1413604450, now seen corresponding path program 3 times [2022-11-26 01:10:18,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:18,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934067169] [2022-11-26 01:10:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:18,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:18,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:18,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1245005704] [2022-11-26 01:10:18,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:10:18,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:18,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:18,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:18,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:10:18,482 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:10:18,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:10:18,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:10:18,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:18,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:18,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:18,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934067169] [2022-11-26 01:10:18,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:18,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245005704] [2022-11-26 01:10:18,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245005704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:18,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [228588007] [2022-11-26 01:10:18,576 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:18,576 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:18,577 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:18,577 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:18,577 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:18,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,683 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:18,683 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-26 01:10:18,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,704 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-26 01:10:18,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,731 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-26 01:10:18,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,777 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-26 01:10:18,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:18,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:18,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:18,990 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:10:18,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:10:19,181 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-26 01:10:19,222 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:19,223 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 29 treesize of output 32 [2022-11-26 01:10:19,258 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:19,262 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 30 treesize of output 33 [2022-11-26 01:10:19,357 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:19,358 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 40 treesize of output 58 [2022-11-26 01:10:19,435 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:19,436 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 39 treesize of output 57 [2022-11-26 01:10:19,466 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:19,847 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '350#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:19,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:19,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:19,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-26 01:10:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639509231] [2022-11-26 01:10:19,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:19,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 01:10:19,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 01:10:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-26 01:10:19,850 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 01:10:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:19,946 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-11-26 01:10:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 01:10:19,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 01:10:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:19,947 INFO L225 Difference]: With dead ends: 14 [2022-11-26 01:10:19,947 INFO L226 Difference]: Without dead ends: 11 [2022-11-26 01:10:19,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-11-26 01:10:19,948 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:19,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:10:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-26 01:10:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-11-26 01:10:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 01:10:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-11-26 01:10:19,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2022-11-26 01:10:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:19,953 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-11-26 01:10:19,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 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-26 01:10:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-11-26 01:10:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:10:19,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:19,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:19,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:20,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:20,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash -871956407, now seen corresponding path program 4 times [2022-11-26 01:10:20,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:20,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260269357] [2022-11-26 01:10:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:20,171 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:20,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [37964907] [2022-11-26 01:10:20,172 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:10:20,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:20,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:20,174 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:20,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:10:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:20,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-26 01:10:20,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:20,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:10:20,278 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-26 01:10:20,301 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-26 01:10:20,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:20,334 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-26 01:10:20,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 102 [2022-11-26 01:10:20,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-26 01:10:20,487 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 48 treesize of output 32 [2022-11-26 01:10:20,537 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 33 [2022-11-26 01:10:20,590 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 62 treesize of output 30 [2022-11-26 01:10:20,608 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:20,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:20,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:10:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:21,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260269357] [2022-11-26 01:10:21,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37964907] [2022-11-26 01:10:21,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37964907] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:21,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1558085194] [2022-11-26 01:10:21,096 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:21,096 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:21,096 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:21,096 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:21,096 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,194 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:21,194 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-26 01:10:21,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,214 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-26 01:10:21,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,238 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-26 01:10:21,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,305 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-26 01:10:21,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:21,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:21,496 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:10:21,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:10:21,584 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-26 01:10:21,627 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:21,627 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 30 treesize of output 33 [2022-11-26 01:10:21,674 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:21,674 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 29 treesize of output 32 [2022-11-26 01:10:21,749 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:21,749 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 39 treesize of output 57 [2022-11-26 01:10:21,804 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:21,805 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 40 treesize of output 58 [2022-11-26 01:10:21,848 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:22,460 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '469#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:22,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:22,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:22,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-26 01:10:22,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908894170] [2022-11-26 01:10:22,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:22,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-26 01:10:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-26 01:10:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=324, Unknown=3, NotChecked=0, Total=380 [2022-11-26 01:10:22,462 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:22,969 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-11-26 01:10:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:10:22,969 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:22,970 INFO L225 Difference]: With dead ends: 18 [2022-11-26 01:10:22,970 INFO L226 Difference]: Without dead ends: 15 [2022-11-26 01:10:22,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=72, Invalid=431, Unknown=3, NotChecked=0, Total=506 [2022-11-26 01:10:22,971 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:22,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:10:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-26 01:10:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2022-11-26 01:10:22,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-11-26 01:10:22,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2022-11-26 01:10:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:22,977 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-11-26 01:10:22,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-11-26 01:10:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:10:22,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:22,978 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:22,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:23,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:23,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:23,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:23,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1260736258, now seen corresponding path program 5 times [2022-11-26 01:10:23,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:23,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286624681] [2022-11-26 01:10:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:23,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:23,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:23,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568397515] [2022-11-26 01:10:23,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:10:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:23,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:23,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:23,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:10:23,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:10:23,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:10:23,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 01:10:23,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:23,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:23,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:23,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286624681] [2022-11-26 01:10:23,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:23,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568397515] [2022-11-26 01:10:23,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568397515] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:23,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2024030764] [2022-11-26 01:10:23,443 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:23,443 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:23,443 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:23,443 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:23,443 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:23,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,512 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:10:23,512 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-26 01:10:23,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,617 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:23,617 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-26 01:10:23,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,640 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-26 01:10:23,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,705 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-26 01:10:23,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:23,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:23,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:23,910 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:10:23,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:10:24,082 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-26 01:10:24,121 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:24,121 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 29 treesize of output 32 [2022-11-26 01:10:24,183 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:24,183 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 30 treesize of output 33 [2022-11-26 01:10:24,318 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:24,318 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 40 treesize of output 58 [2022-11-26 01:10:24,394 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:24,394 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 39 treesize of output 57 [2022-11-26 01:10:24,424 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:24,843 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '599#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:24,843 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:24,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:24,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-26 01:10:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297097580] [2022-11-26 01:10:24,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:24,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 01:10:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:24,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 01:10:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-26 01:10:24,845 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:24,946 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-11-26 01:10:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 01:10:24,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 01:10:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:24,948 INFO L225 Difference]: With dead ends: 23 [2022-11-26 01:10:24,948 INFO L226 Difference]: Without dead ends: 16 [2022-11-26 01:10:24,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:10:24,949 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:24,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 14 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-26 01:10:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2022-11-26 01:10:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 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-26 01:10:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-11-26 01:10:24,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2022-11-26 01:10:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:24,970 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-11-26 01:10:24,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-11-26 01:10:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:10:24,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:24,971 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:24,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:25,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 01:10:25,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:25,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:25,177 INFO L85 PathProgramCache]: Analyzing trace with hash 973526812, now seen corresponding path program 6 times [2022-11-26 01:10:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:25,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436865309] [2022-11-26 01:10:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:25,201 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:25,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865039622] [2022-11-26 01:10:25,202 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:10:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:25,203 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:25,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:10:25,297 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:10:25,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:10:25,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 01:10:25,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:25,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:25,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436865309] [2022-11-26 01:10:25,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865039622] [2022-11-26 01:10:25,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865039622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:25,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [563404099] [2022-11-26 01:10:25,413 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:25,414 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:25,414 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:25,414 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:25,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:25,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,506 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:25,507 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-26 01:10:25,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,527 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-26 01:10:25,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,567 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-26 01:10:25,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,617 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-26 01:10:25,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:25,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:25,800 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:10:25,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:10:25,884 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-26 01:10:25,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:25,926 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:25,927 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 39 treesize of output 37 [2022-11-26 01:10:25,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:25,973 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:25,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 40 treesize of output 38 [2022-11-26 01:10:26,088 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:26,088 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 40 treesize of output 58 [2022-11-26 01:10:26,153 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:26,154 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 39 treesize of output 57 [2022-11-26 01:10:26,181 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:26,551 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '737#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:26,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:26,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:26,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-26 01:10:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135994027] [2022-11-26 01:10:26,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:26,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 01:10:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 01:10:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-11-26 01:10:26,553 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:26,680 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-11-26 01:10:26,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:10:26,680 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-26 01:10:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:26,681 INFO L225 Difference]: With dead ends: 16 [2022-11-26 01:10:26,681 INFO L226 Difference]: Without dead ends: 13 [2022-11-26 01:10:26,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-11-26 01:10:26,682 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:26,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-26 01:10:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-26 01:10:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 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-26 01:10:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-11-26 01:10:26,687 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-11-26 01:10:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:26,687 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-11-26 01:10:26,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-11-26 01:10:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 01:10:26,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:26,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:26,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:26,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:26,891 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:26,892 INFO L85 PathProgramCache]: Analyzing trace with hash 114668683, now seen corresponding path program 7 times [2022-11-26 01:10:26,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:26,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739409342] [2022-11-26 01:10:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:26,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:26,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257090334] [2022-11-26 01:10:26,905 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:10:26,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:26,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:26,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:26,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 01:10:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:26,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-26 01:10:27,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:27,008 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-26 01:10:27,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:10:27,036 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-26 01:10:27,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:27,065 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 31 treesize of output 33 [2022-11-26 01:10:27,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:27,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:27,107 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-26 01:10:27,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 109 [2022-11-26 01:10:27,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-26 01:10:27,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:27,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 102 [2022-11-26 01:10:27,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-26 01:10:27,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-26 01:10:27,418 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 60 treesize of output 45 [2022-11-26 01:10:27,514 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 70 treesize of output 34 [2022-11-26 01:10:27,537 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-26 01:10:27,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:27,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:10:27,697 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse3 1)) (.cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (not .cse0) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (and (= .cse1 1) (= c_~N~0 (+ .cse2 .cse1 .cse3))))))) (or .cse0 (and (forall ((v_ArrVal_318 (Array Int Int))) (= c_~N~0 (+ (select v_ArrVal_318 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1)))))))) is different from false [2022-11-26 01:10:28,589 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse10 1)) (.cse6 (and (forall ((v_ArrVal_318 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) (select v_ArrVal_318 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_318 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 1)))) (.cse4 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_314 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= c_~N~0 (let ((.cse2 (select v_ArrVal_314 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_314 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (= .cse1 1))))) (forall ((v_ArrVal_314 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= .cse5 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_314 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 (select v_ArrVal_314 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 1)))) (or (forall ((v_ArrVal_314 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)) .cse6))) (or (not .cse0) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse12 (= .cse9 1))) (and (or (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (and (= .cse7 1) (= c_~N~0 (+ .cse8 .cse9 .cse10 .cse7)))) (not .cse12)) (or .cse12 .cse6))))))))))) is different from false [2022-11-26 01:10:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-26 01:10:32,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:32,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739409342] [2022-11-26 01:10:32,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:32,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257090334] [2022-11-26 01:10:32,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257090334] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:32,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [151670445] [2022-11-26 01:10:32,202 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:32,208 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:32,208 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:32,209 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:32,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:32,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,392 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:32,392 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-26 01:10:32,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,413 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-26 01:10:32,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,431 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-26 01:10:32,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,477 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-26 01:10:32,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:32,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:32,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:32,719 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:10:32,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:10:32,872 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-26 01:10:32,934 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:32,934 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 29 treesize of output 32 [2022-11-26 01:10:32,991 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:10:32,991 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 30 treesize of output 33 [2022-11-26 01:10:33,109 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:33,109 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 40 treesize of output 58 [2022-11-26 01:10:33,223 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:33,223 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 39 treesize of output 57 [2022-11-26 01:10:33,254 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:34,293 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '882#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:34,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:34,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:34,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-26 01:10:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030670310] [2022-11-26 01:10:34,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:34,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 01:10:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:34,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 01:10:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=405, Unknown=2, NotChecked=82, Total=552 [2022-11-26 01:10:34,295 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 20 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:35,952 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-11-26 01:10:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 01:10:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-26 01:10:35,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:35,953 INFO L225 Difference]: With dead ends: 25 [2022-11-26 01:10:35,953 INFO L226 Difference]: Without dead ends: 22 [2022-11-26 01:10:35,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=88, Invalid=568, Unknown=2, NotChecked=98, Total=756 [2022-11-26 01:10:35,954 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:35,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 27 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 30 Unchecked, 0.8s Time] [2022-11-26 01:10:35,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-26 01:10:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2022-11-26 01:10:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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-26 01:10:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-26 01:10:35,962 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-11-26 01:10:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:35,963 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-26 01:10:35,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-26 01:10:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 01:10:35,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:35,964 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:35,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:36,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:36,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:36,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash -740129540, now seen corresponding path program 8 times [2022-11-26 01:10:36,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:36,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129246455] [2022-11-26 01:10:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:36,184 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:36,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142338071] [2022-11-26 01:10:36,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:10:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:36,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:36,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:36,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:10:36,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:10:36,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:10:36,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:10:36,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:36,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:36,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:36,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129246455] [2022-11-26 01:10:36,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:36,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142338071] [2022-11-26 01:10:36,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142338071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:36,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920628321] [2022-11-26 01:10:36,575 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:36,575 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:36,575 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:36,575 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:36,575 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:36,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,753 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:36,753 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-26 01:10:36,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,776 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-26 01:10:36,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,812 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-26 01:10:36,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,855 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-26 01:10:36,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:36,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:37,080 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:10:37,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:10:37,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-26 01:10:37,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:37,261 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:37,261 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 40 treesize of output 38 [2022-11-26 01:10:37,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:37,348 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:37,348 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 39 treesize of output 37 [2022-11-26 01:10:37,480 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:37,481 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 40 treesize of output 58 [2022-11-26 01:10:37,591 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:37,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 57 [2022-11-26 01:10:37,621 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:38,351 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1045#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:38,351 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:38,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:38,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-11-26 01:10:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043690830] [2022-11-26 01:10:38,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:38,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 01:10:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 01:10:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-11-26 01:10:38,353 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:38,569 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-11-26 01:10:38,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 01:10:38,570 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:38,570 INFO L225 Difference]: With dead ends: 26 [2022-11-26 01:10:38,570 INFO L226 Difference]: Without dead ends: 18 [2022-11-26 01:10:38,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2022-11-26 01:10:38,572 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:38,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:38,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-26 01:10:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2022-11-26 01:10:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:10:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-26 01:10:38,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2022-11-26 01:10:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:38,579 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-26 01:10:38,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-26 01:10:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-26 01:10:38,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:38,580 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:38,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:38,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 01:10:38,780 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash -197451106, now seen corresponding path program 9 times [2022-11-26 01:10:38,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:38,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202368890] [2022-11-26 01:10:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:38,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:38,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:38,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304679946] [2022-11-26 01:10:38,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:10:38,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:38,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:38,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:38,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 01:10:38,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:10:38,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:10:38,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:10:38,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:39,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:39,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:39,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202368890] [2022-11-26 01:10:39,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304679946] [2022-11-26 01:10:39,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304679946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [956617215] [2022-11-26 01:10:39,203 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:39,203 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:39,204 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:39,204 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:39,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:39,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,277 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:10:39,278 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-26 01:10:39,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,433 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:10:39,433 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-26 01:10:39,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,607 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:39,608 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-26 01:10:39,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,662 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-26 01:10:39,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:39,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:39,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:39,880 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:10:39,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:10:40,029 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-26 01:10:40,057 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:40,100 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:40,101 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 39 treesize of output 37 [2022-11-26 01:10:40,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:40,165 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:40,165 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 40 treesize of output 38 [2022-11-26 01:10:40,300 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:40,301 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 40 treesize of output 58 [2022-11-26 01:10:40,413 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:40,414 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 39 treesize of output 57 [2022-11-26 01:10:40,450 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:41,081 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1210#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:41,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:41,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:41,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-26 01:10:41,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132419978] [2022-11-26 01:10:41,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:41,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:10:41,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:10:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-11-26 01:10:41,083 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:10:41,339 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-11-26 01:10:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 01:10:41,339 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:10:41,340 INFO L225 Difference]: With dead ends: 18 [2022-11-26 01:10:41,340 INFO L226 Difference]: Without dead ends: 15 [2022-11-26 01:10:41,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-11-26 01:10:41,341 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:10:41,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 10 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:10:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-26 01:10:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-26 01:10:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 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-26 01:10:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-11-26 01:10:41,348 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2022-11-26 01:10:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:10:41,349 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-11-26 01:10:41,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:10:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-11-26 01:10:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 01:10:41,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:10:41,350 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-26 01:10:41,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 01:10:41,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-26 01:10:41,556 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:10:41,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:10:41,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1825908407, now seen corresponding path program 10 times [2022-11-26 01:10:41,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:10:41,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434664043] [2022-11-26 01:10:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:10:41,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:10:41,584 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:10:41,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016213751] [2022-11-26 01:10:41,585 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:10:41,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:10:41,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:10:41,586 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:10:41,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 01:10:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:10:41,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-26 01:10:41,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:10:41,714 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-26 01:10:41,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:10:41,785 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-26 01:10:41,853 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 36 treesize of output 38 [2022-11-26 01:10:41,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:41,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:41,916 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-26 01:10:42,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:42,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:42,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:42,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-26 01:10:42,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:42,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:42,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:42,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-11-26 01:10:42,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 118 [2022-11-26 01:10:42,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-26 01:10:42,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:42,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 115 [2022-11-26 01:10:42,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-26 01:10:42,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2022-11-26 01:10:42,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 37 [2022-11-26 01:10:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:10:42,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:10:43,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:10:43,223 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse4 1)) (.cse1 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_515 (Array Int Int))) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_515 (Array Int Int))) (= c_~N~0 (+ (select v_ArrVal_515 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_515) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (or (not .cse0) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (and (= .cse2 1) (= c_~N~0 (+ .cse3 .cse2 .cse4))))))))))) is different from false [2022-11-26 01:10:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-26 01:10:53,355 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:10:53,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434664043] [2022-11-26 01:10:53,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:10:53,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016213751] [2022-11-26 01:10:53,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016213751] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:10:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1364365780] [2022-11-26 01:10:53,357 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:10:53,357 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:10:53,358 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:10:53,358 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:10:53,358 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:10:53,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,542 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:10:53,542 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-26 01:10:53,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,603 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:10:53,604 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-26 01:10:53,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,815 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:10:53,815 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-26 01:10:53,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:53,869 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-26 01:10:53,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:54,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:54,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:54,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:54,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:10:54,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:54,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:54,154 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:10:54,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:10:54,317 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-26 01:10:54,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:54,398 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:54,398 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 39 treesize of output 37 [2022-11-26 01:10:54,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:10:54,482 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:10:54,483 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 40 treesize of output 38 [2022-11-26 01:10:54,628 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:54,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-26 01:10:54,743 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:10:54,743 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 39 treesize of output 57 [2022-11-26 01:10:54,784 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:10:56,111 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1381#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:10:56,111 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:10:56,112 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:10:56,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-11-26 01:10:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142167066] [2022-11-26 01:10:56,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:10:56,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-26 01:10:56,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:10:56,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-26 01:10:56,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=606, Unknown=7, NotChecked=50, Total=756 [2022-11-26 01:10:56,114 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:11:22,400 WARN L233 SmtUtils]: Spent 9.69s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:11:31,650 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:11:31,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:31,927 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-26 01:11:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 01:11:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-26 01:11:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:31,932 INFO L225 Difference]: With dead ends: 28 [2022-11-26 01:11:31,932 INFO L226 Difference]: Without dead ends: 25 [2022-11-26 01:11:31,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 43.3s TimeCoverageRelationStatistics Valid=154, Invalid=965, Unknown=7, NotChecked=64, Total=1190 [2022-11-26 01:11:31,933 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:31,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 30 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 244 Invalid, 0 Unknown, 22 Unchecked, 3.7s Time] [2022-11-26 01:11:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-26 01:11:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-11-26 01:11:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-26 01:11:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-26 01:11:31,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2022-11-26 01:11:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:31,946 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-26 01:11:31,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:11:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-26 01:11:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 01:11:31,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:31,947 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:31,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:32,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 01:11:32,153 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:11:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash -768477186, now seen corresponding path program 11 times [2022-11-26 01:11:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:32,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288220909] [2022-11-26 01:11:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:32,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:11:32,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569484755] [2022-11-26 01:11:32,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:11:32,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:32,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:32,166 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:32,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 01:11:32,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 01:11:32,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:11:32,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 01:11:32,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:11:32,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:32,801 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:11:32,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288220909] [2022-11-26 01:11:32,802 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:11:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569484755] [2022-11-26 01:11:32,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569484755] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:32,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [991394136] [2022-11-26 01:11:32,804 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:11:32,804 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:32,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:32,804 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:32,804 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:32,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:32,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:32,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:32,960 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:11:32,960 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-26 01:11:32,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:32,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:32,985 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-26 01:11:33,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,004 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-26 01:11:33,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,047 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-26 01:11:33,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:33,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:33,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:33,296 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:11:33,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:11:33,475 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-26 01:11:33,560 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:11:33,560 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 29 treesize of output 32 [2022-11-26 01:11:33,811 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:11:33,812 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 30 treesize of output 33 [2022-11-26 01:11:33,974 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:11:33,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 39 treesize of output 57 [2022-11-26 01:11:34,100 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:11:34,100 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 40 treesize of output 58 [2022-11-26 01:11:34,145 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:35,027 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1574#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:11:35,027 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:35,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:11:35,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2022-11-26 01:11:35,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373560667] [2022-11-26 01:11:35,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:35,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 01:11:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:35,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 01:11:35,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2022-11-26 01:11:35,030 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:11:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:35,327 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-11-26 01:11:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 01:11:35,330 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:11:35,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:35,330 INFO L225 Difference]: With dead ends: 29 [2022-11-26 01:11:35,330 INFO L226 Difference]: Without dead ends: 20 [2022-11-26 01:11:35,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2022-11-26 01:11:35,331 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:35,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:11:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-26 01:11:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2022-11-26 01:11:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:11:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-11-26 01:11:35,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2022-11-26 01:11:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:35,349 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-11-26 01:11:35,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:11:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-11-26 01:11:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 01:11:35,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:35,350 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:35,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 01:11:35,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:35,556 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:11:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1125314916, now seen corresponding path program 12 times [2022-11-26 01:11:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:35,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591858530] [2022-11-26 01:11:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:35,570 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:11:35,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812289016] [2022-11-26 01:11:35,571 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:11:35,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:35,572 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:35,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 01:11:35,735 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:11:35,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:11:35,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 01:11:35,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:11:36,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:11:36,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:36,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591858530] [2022-11-26 01:11:36,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:11:36,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812289016] [2022-11-26 01:11:36,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812289016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:36,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [356364394] [2022-11-26 01:11:36,206 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:11:36,206 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:36,206 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:36,206 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:36,207 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:36,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,392 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:11:36,392 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-26 01:11:36,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,564 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:11:36,564 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-26 01:11:36,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,587 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-26 01:11:36,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,625 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-26 01:11:36,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:36,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:36,932 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:11:36,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:11:37,015 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-26 01:11:37,102 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:11:37,102 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 30 treesize of output 33 [2022-11-26 01:11:37,202 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:11:37,202 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 29 treesize of output 32 [2022-11-26 01:11:37,318 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:11:37,319 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 39 treesize of output 57 [2022-11-26 01:11:37,443 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:11:37,443 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 40 treesize of output 58 [2022-11-26 01:11:37,509 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:38,264 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1766#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:11:38,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:38,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:11:38,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2022-11-26 01:11:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379540810] [2022-11-26 01:11:38,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:38,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 01:11:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 01:11:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2022-11-26 01:11:38,267 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:11:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:11:38,624 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-11-26 01:11:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 01:11:38,624 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:11:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:11:38,625 INFO L225 Difference]: With dead ends: 20 [2022-11-26 01:11:38,625 INFO L226 Difference]: Without dead ends: 17 [2022-11-26 01:11:38,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2022-11-26 01:11:38,626 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:11:38,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:11:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-26 01:11:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-26 01:11:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 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-26 01:11:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-11-26 01:11:38,638 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-11-26 01:11:38,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:11:38,639 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-11-26 01:11:38,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:11:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-11-26 01:11:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 01:11:38,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:11:38,640 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2022-11-26 01:11:38,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-26 01:11:38,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:38,846 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:11:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:11:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -524915445, now seen corresponding path program 13 times [2022-11-26 01:11:38,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:11:38,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090509346] [2022-11-26 01:11:38,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:11:38,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:11:38,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:11:38,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055396495] [2022-11-26 01:11:38,860 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:11:38,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:11:38,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:11:38,862 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:11:38,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 01:11:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:11:38,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-26 01:11:38,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:11:38,996 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-26 01:11:39,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-26 01:11:39,036 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-26 01:11:39,091 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 36 treesize of output 38 [2022-11-26 01:11:39,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,152 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-26 01:11:39,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-11-26 01:11:39,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:39,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 66 [2022-11-26 01:11:39,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 123 [2022-11-26 01:11:39,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-26 01:11:39,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2022-11-26 01:11:39,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-26 01:11:39,792 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 86 treesize of output 62 [2022-11-26 01:11:39,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 139 [2022-11-26 01:11:39,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2022-11-26 01:11:40,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:40,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2022-11-26 01:11:40,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2022-11-26 01:11:40,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 67 [2022-11-26 01:11:40,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 44 [2022-11-26 01:11:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:11:40,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:11:40,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:11:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:11:51,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:11:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090509346] [2022-11-26 01:11:51,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:11:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055396495] [2022-11-26 01:11:51,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055396495] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:11:51,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156285016] [2022-11-26 01:11:51,459 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:11:51,464 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:11:51,464 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:11:51,465 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:11:51,465 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:11:51,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,518 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:11:51,519 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-26 01:11:51,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,657 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:11:51,657 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-26 01:11:51,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,822 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:11:51,822 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-26 01:11:51,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,861 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-26 01:11:51,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:51,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:51,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:11:52,078 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:11:52,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:11:52,154 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-26 01:11:52,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:52,220 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:11:52,221 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 39 treesize of output 37 [2022-11-26 01:11:52,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:52,332 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:11:52,332 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 40 treesize of output 38 [2022-11-26 01:11:52,457 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:11:52,457 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 39 treesize of output 57 [2022-11-26 01:11:52,592 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:11:52,593 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 40 treesize of output 58 [2022-11-26 01:11:52,648 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:11:54,619 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1963#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:11:54,620 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:11:54,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:11:54,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-11-26 01:11:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604251669] [2022-11-26 01:11:54,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:11:54,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-26 01:11:54,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:11:54,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-26 01:11:54,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=902, Unknown=1, NotChecked=0, Total=992 [2022-11-26 01:11:54,622 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:02,248 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-26 01:12:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 01:12:02,249 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-26 01:12:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:02,250 INFO L225 Difference]: With dead ends: 31 [2022-11-26 01:12:02,250 INFO L226 Difference]: Without dead ends: 28 [2022-11-26 01:12:02,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=108, Invalid=1081, Unknown=1, NotChecked=0, Total=1190 [2022-11-26 01:12:02,251 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:02,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 36 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-26 01:12:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-26 01:12:02,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2022-11-26 01:12:02,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:12:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-11-26 01:12:02,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-11-26 01:12:02,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:02,272 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-11-26 01:12:02,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:02,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-11-26 01:12:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 01:12:02,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:12:02,273 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-26 01:12:02,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 01:12:02,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 01:12:02,475 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:12:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:12:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash 907598972, now seen corresponding path program 14 times [2022-11-26 01:12:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:12:02,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770123588] [2022-11-26 01:12:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:12:02,499 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:12:02,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990490261] [2022-11-26 01:12:02,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:12:02,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:02,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:12:02,501 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:12:02,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 01:12:02,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 01:12:02,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:12:02,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 01:12:02,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:12:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:03,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:12:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:03,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:12:03,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770123588] [2022-11-26 01:12:03,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:12:03,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990490261] [2022-11-26 01:12:03,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990490261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:12:03,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1890409133] [2022-11-26 01:12:03,232 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:12:03,232 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:03,233 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:03,233 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:03,233 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:03,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,394 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:12:03,394 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-26 01:12:03,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,413 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-26 01:12:03,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,438 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-26 01:12:03,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,482 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-26 01:12:03,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:03,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:03,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:03,695 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:12:03,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:12:03,784 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-26 01:12:03,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:03,849 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:12:03,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 39 treesize of output 37 [2022-11-26 01:12:03,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:03,918 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:12:03,918 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 40 treesize of output 38 [2022-11-26 01:12:04,071 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:04,071 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 40 treesize of output 58 [2022-11-26 01:12:04,224 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:04,225 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 39 treesize of output 57 [2022-11-26 01:12:04,256 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:05,278 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2173#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:12:05,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:05,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:12:05,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2022-11-26 01:12:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863965234] [2022-11-26 01:12:05,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:05,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-26 01:12:05,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:05,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-26 01:12:05,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:12:05,280 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:05,630 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-11-26 01:12:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 01:12:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 01:12:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:05,631 INFO L225 Difference]: With dead ends: 32 [2022-11-26 01:12:05,632 INFO L226 Difference]: Without dead ends: 22 [2022-11-26 01:12:05,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2022-11-26 01:12:05,633 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:05,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:12:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-26 01:12:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-11-26 01:12:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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-26 01:12:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-11-26 01:12:05,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2022-11-26 01:12:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:05,647 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-11-26 01:12:05,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-11-26 01:12:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 01:12:05,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:12:05,648 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-26 01:12:05,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 01:12:05,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:05,849 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:12:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:12:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1564436066, now seen corresponding path program 15 times [2022-11-26 01:12:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:12:05,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115444771] [2022-11-26 01:12:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:12:05,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:12:05,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210107312] [2022-11-26 01:12:05,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:12:05,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:05,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:12:05,865 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:12:05,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 01:12:06,091 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:12:06,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:12:06,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 01:12:06,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:12:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:06,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:12:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:06,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:12:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115444771] [2022-11-26 01:12:06,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:12:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210107312] [2022-11-26 01:12:06,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210107312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:12:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [371286732] [2022-11-26 01:12:06,582 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:12:06,583 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:06,583 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:06,583 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:06,583 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:06,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,750 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:12:06,750 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-26 01:12:06,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,911 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:12:06,911 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-26 01:12:06,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,931 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-26 01:12:06,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:06,970 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-26 01:12:07,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:07,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:07,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:07,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:07,079 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:07,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:07,190 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:12:07,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:12:07,275 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-26 01:12:07,349 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:12:07,349 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 30 treesize of output 33 [2022-11-26 01:12:07,429 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:12:07,429 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 29 treesize of output 32 [2022-11-26 01:12:07,535 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:07,536 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 39 treesize of output 57 [2022-11-26 01:12:07,643 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:07,643 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 40 treesize of output 58 [2022-11-26 01:12:07,681 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:08,454 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2392#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:12:08,454 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:08,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:12:08,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-11-26 01:12:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375793701] [2022-11-26 01:12:08,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:08,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 01:12:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:08,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 01:12:08,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-11-26 01:12:08,456 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:08,823 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-11-26 01:12:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 01:12:08,824 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-26 01:12:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:08,824 INFO L225 Difference]: With dead ends: 22 [2022-11-26 01:12:08,825 INFO L226 Difference]: Without dead ends: 19 [2022-11-26 01:12:08,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 01:12:08,826 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:08,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:12:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-26 01:12:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-11-26 01:12:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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-26 01:12:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-11-26 01:12:08,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2022-11-26 01:12:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:08,844 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-11-26 01:12:08,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-11-26 01:12:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 01:12:08,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:12:08,845 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2022-11-26 01:12:08,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-26 01:12:09,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 01:12:09,051 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:12:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:12:09,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1252769207, now seen corresponding path program 16 times [2022-11-26 01:12:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:12:09,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906645203] [2022-11-26 01:12:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:12:09,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:12:09,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1787539921] [2022-11-26 01:12:09,075 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:12:09,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:12:09,076 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:12:09,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-26 01:12:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:12:09,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-26 01:12:09,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:12:09,218 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-26 01:12:09,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:12:09,264 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-26 01:12:09,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,310 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-26 01:12:09,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,370 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 40 treesize of output 45 [2022-11-26 01:12:09,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-26 01:12:09,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 75 [2022-11-26 01:12:09,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-11-26 01:12:09,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:09,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2022-11-26 01:12:10,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 132 [2022-11-26 01:12:10,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2022-11-26 01:12:10,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-26 01:12:10,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2022-11-26 01:12:10,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2022-11-26 01:12:10,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-26 01:12:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:10,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2022-11-26 01:12:10,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 78 [2022-11-26 01:12:10,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 40 [2022-11-26 01:12:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:11,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:12:11,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:12:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:36,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:12:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906645203] [2022-11-26 01:12:36,506 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:12:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787539921] [2022-11-26 01:12:36,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787539921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:12:36,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420517402] [2022-11-26 01:12:36,507 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:12:36,508 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:36,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:36,508 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:36,508 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:36,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,662 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:12:36,662 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-26 01:12:36,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,681 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-26 01:12:36,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,706 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-26 01:12:36,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,740 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-26 01:12:36,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:36,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:36,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:36,962 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:12:36,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:12:37,041 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-26 01:12:37,108 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:12:37,109 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 30 treesize of output 33 [2022-11-26 01:12:37,186 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-11-26 01:12:37,186 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 29 treesize of output 32 [2022-11-26 01:12:37,294 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:37,295 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 39 treesize of output 57 [2022-11-26 01:12:37,425 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:37,425 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 40 treesize of output 58 [2022-11-26 01:12:37,474 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:40,421 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2615#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:12:40,421 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:40,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:12:40,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-11-26 01:12:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760335536] [2022-11-26 01:12:40,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:40,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 01:12:40,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:40,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 01:12:40,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1156, Unknown=3, NotChecked=0, Total=1260 [2022-11-26 01:12:40,423 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 32 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:54,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:54,815 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-11-26 01:12:54,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 01:12:54,816 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-26 01:12:54,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:54,817 INFO L225 Difference]: With dead ends: 34 [2022-11-26 01:12:54,817 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 01:12:54,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=120, Invalid=1359, Unknown=3, NotChecked=0, Total=1482 [2022-11-26 01:12:54,818 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:54,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-11-26 01:12:54,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 01:12:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2022-11-26 01:12:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-26 01:12:54,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2022-11-26 01:12:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:54,834 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-26 01:12:54,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-26 01:12:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:12:54,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:12:54,835 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-11-26 01:12:54,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-26 01:12:55,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 01:12:55,039 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:12:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:12:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash -181031170, now seen corresponding path program 17 times [2022-11-26 01:12:55,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:12:55,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005662013] [2022-11-26 01:12:55,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:12:55,054 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:12:55,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [222535021] [2022-11-26 01:12:55,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:12:55,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:12:55,056 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:12:55,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 01:12:55,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-26 01:12:55,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:12:55,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 01:12:55,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:12:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:55,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:12:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:55,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:12:55,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005662013] [2022-11-26 01:12:55,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:12:55,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222535021] [2022-11-26 01:12:55,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222535021] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:12:55,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [537065456] [2022-11-26 01:12:55,932 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:12:55,933 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:55,933 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:55,933 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:55,933 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:55,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:55,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,095 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:12:56,096 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-26 01:12:56,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,150 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:12:56,151 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-26 01:12:56,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,304 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:12:56,304 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-26 01:12:56,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,340 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-26 01:12:56,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:56,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:56,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:56,541 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:12:56,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:12:56,633 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-26 01:12:56,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:56,709 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:12:56,709 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 40 treesize of output 38 [2022-11-26 01:12:56,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:56,776 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:12:56,776 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 39 treesize of output 37 [2022-11-26 01:12:56,876 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:56,877 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 39 treesize of output 57 [2022-11-26 01:12:56,979 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:12:56,979 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 40 treesize of output 58 [2022-11-26 01:12:57,019 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:58,018 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2850#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:12:58,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:58,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:12:58,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-11-26 01:12:58,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821431760] [2022-11-26 01:12:58,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:58,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 01:12:58,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:58,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 01:12:58,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-11-26 01:12:58,020 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:12:58,415 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-11-26 01:12:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 01:12:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 01:12:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:12:58,416 INFO L225 Difference]: With dead ends: 35 [2022-11-26 01:12:58,416 INFO L226 Difference]: Without dead ends: 24 [2022-11-26 01:12:58,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=268, Invalid=922, Unknown=0, NotChecked=0, Total=1190 [2022-11-26 01:12:58,417 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:12:58,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:12:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-26 01:12:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-11-26 01:12:58,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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-26 01:12:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-11-26 01:12:58,436 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2022-11-26 01:12:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:12:58,436 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-11-26 01:12:58,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:12:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-11-26 01:12:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:12:58,437 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:12:58,437 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2022-11-26 01:12:58,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-26 01:12:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:58,643 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:12:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:12:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 495293980, now seen corresponding path program 18 times [2022-11-26 01:12:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:12:58,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674340585] [2022-11-26 01:12:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:12:58,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:12:58,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:12:58,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1500650210] [2022-11-26 01:12:58,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:12:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:12:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:12:58,660 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:12:58,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-26 01:12:58,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:12:58,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:12:58,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 01:12:58,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:12:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:59,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:12:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:12:59,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:12:59,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674340585] [2022-11-26 01:12:59,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:12:59,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500650210] [2022-11-26 01:12:59,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500650210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:12:59,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [517622156] [2022-11-26 01:12:59,491 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:12:59,491 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:59,491 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:59,491 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:59,491 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:59,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,634 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:12:59,634 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-26 01:12:59,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,654 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-26 01:12:59,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,678 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-26 01:12:59,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,706 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-26 01:12:59,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:12:59,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:59,898 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:12:59,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:12:59,971 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-26 01:12:59,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:13:00,046 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:13:00,047 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 40 treesize of output 38 [2022-11-26 01:13:00,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:13:00,117 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:13:00,118 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 39 treesize of output 37 [2022-11-26 01:13:00,227 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:13:00,228 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 39 treesize of output 57 [2022-11-26 01:13:00,322 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:13:00,323 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 40 treesize of output 58 [2022-11-26 01:13:00,356 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:13:01,136 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3096#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:13:01,137 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:13:01,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:13:01,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-11-26 01:13:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944216110] [2022-11-26 01:13:01,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:13:01,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-26 01:13:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:13:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-26 01:13:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-11-26 01:13:01,138 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 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-26 01:13:01,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:13:01,543 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-11-26 01:13:01,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 01:13:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 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) Word has length 19 [2022-11-26 01:13:01,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:13:01,545 INFO L225 Difference]: With dead ends: 24 [2022-11-26 01:13:01,545 INFO L226 Difference]: Without dead ends: 21 [2022-11-26 01:13:01,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 14 SyntacticMatches, 15 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=284, Invalid=1048, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 01:13:01,547 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:13:01,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:13:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-26 01:13:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-26 01:13:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:13:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-11-26 01:13:01,563 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2022-11-26 01:13:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:13:01,563 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-11-26 01:13:01,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 24 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-26 01:13:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-11-26 01:13:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 01:13:01,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:13:01,564 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2022-11-26 01:13:01,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-26 01:13:01,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:13:01,767 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:13:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:13:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1825647221, now seen corresponding path program 19 times [2022-11-26 01:13:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:13:01,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542408913] [2022-11-26 01:13:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:13:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:13:01,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:13:01,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [866496083] [2022-11-26 01:13:01,783 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:13:01,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:13:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:13:01,784 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:13:01,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-26 01:13:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:13:01,968 WARN L261 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-26 01:13:01,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:13:01,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:13:02,002 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-26 01:13:02,043 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-26 01:13:02,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,078 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 31 treesize of output 33 [2022-11-26 01:13:02,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,135 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-26 01:13:02,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2022-11-26 01:13:02,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2022-11-26 01:13:02,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-11-26 01:13:02,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:02,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 93 [2022-11-26 01:13:02,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2022-11-26 01:13:02,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-26 01:13:03,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2022-11-26 01:13:03,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 97 [2022-11-26 01:13:03,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 100 [2022-11-26 01:13:03,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 162 [2022-11-26 01:13:03,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2022-11-26 01:13:03,537 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 139 treesize of output 103 [2022-11-26 01:13:03,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:03,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 104 [2022-11-26 01:13:03,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2022-11-26 01:13:04,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 22 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 41 [2022-11-26 01:13:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:13:04,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:13:04,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:13:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:13:56,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:13:56,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542408913] [2022-11-26 01:13:56,148 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:13:56,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866496083] [2022-11-26 01:13:56,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866496083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:13:56,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [114872201] [2022-11-26 01:13:56,150 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:13:56,150 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:13:56,150 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:13:56,150 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:13:56,151 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:13:56,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,325 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:13:56,326 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-26 01:13:56,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,346 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-26 01:13:56,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,362 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-26 01:13:56,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,399 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-26 01:13:56,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:13:56,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:13:56,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:13:56,643 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:13:56,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:13:56,770 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-26 01:13:56,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:13:56,830 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:13:56,831 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 39 treesize of output 37 [2022-11-26 01:13:56,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:13:56,903 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:13:56,904 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 40 treesize of output 38 [2022-11-26 01:13:57,044 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:13:57,044 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 39 treesize of output 57 [2022-11-26 01:13:57,155 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:13:57,155 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 40 treesize of output 58 [2022-11-26 01:13:57,188 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:14:01,625 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3345#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:14:01,625 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:14:01,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:14:01,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-11-26 01:14:01,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817594016] [2022-11-26 01:14:01,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:14:01,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-26 01:14:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:14:01,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-26 01:14:01,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1445, Unknown=3, NotChecked=0, Total=1560 [2022-11-26 01:14:01,627 INFO L87 Difference]: Start difference. First operand 21 states and 22 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-26 01:14:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:14:27,267 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-11-26 01:14:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 01:14:27,270 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-26 01:14:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:14:27,270 INFO L225 Difference]: With dead ends: 37 [2022-11-26 01:14:27,270 INFO L226 Difference]: Without dead ends: 34 [2022-11-26 01:14:27,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 63.8s TimeCoverageRelationStatistics Valid=131, Invalid=1672, Unknown=3, NotChecked=0, Total=1806 [2022-11-26 01:14:27,271 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:14:27,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-11-26 01:14:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-26 01:14:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2022-11-26 01:14:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:14:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-26 01:14:27,293 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2022-11-26 01:14:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:14:27,293 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-26 01:14:27,293 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-26 01:14:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-26 01:14:27,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:14:27,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:14:27,294 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2022-11-26 01:14:27,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-26 01:14:27,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:14:27,499 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:14:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:14:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -760380420, now seen corresponding path program 20 times [2022-11-26 01:14:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:14:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417828947] [2022-11-26 01:14:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:14:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:14:27,514 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:14:27,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556492728] [2022-11-26 01:14:27,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:14:27,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:14:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:14:27,516 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:14:27,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-26 01:14:27,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-26 01:14:27,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:14:27,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 01:14:28,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:14:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:14:28,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:14:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:14:28,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:14:28,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417828947] [2022-11-26 01:14:28,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:14:28,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556492728] [2022-11-26 01:14:28,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556492728] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:14:28,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1202547326] [2022-11-26 01:14:28,673 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:14:28,673 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:14:28,673 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:14:28,673 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:14:28,674 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:14:28,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:28,724 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:14:28,724 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-26 01:14:28,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:28,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:28,872 INFO L321 Elim1Store]: treesize reduction 68, result has 33.3 percent of original size [2022-11-26 01:14:28,872 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-26 01:14:28,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:28,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:28,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,036 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:14:29,037 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-26 01:14:29,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,075 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-26 01:14:29,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:29,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:14:29,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:14:29,283 INFO L321 Elim1Store]: treesize reduction 186, result has 18.4 percent of original size [2022-11-26 01:14:29,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 24 case distinctions, treesize of input 429 treesize of output 424 [2022-11-26 01:14:29,370 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-26 01:14:29,390 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:14:29,444 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:14:29,445 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 39 treesize of output 37 [2022-11-26 01:14:29,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:14:29,514 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:14:29,515 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 40 treesize of output 38 [2022-11-26 01:14:29,628 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:14:29,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 58 [2022-11-26 01:14:29,727 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:14:29,727 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 39 treesize of output 57 [2022-11-26 01:14:29,751 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:14:30,940 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3605#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:14:30,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:14:30,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:14:30,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2022-11-26 01:14:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530014880] [2022-11-26 01:14:30,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:14:30,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-26 01:14:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:14:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-26 01:14:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2022-11-26 01:14:30,942 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:14:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:14:31,422 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-11-26 01:14:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-26 01:14:31,423 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-26 01:14:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:14:31,423 INFO L225 Difference]: With dead ends: 38 [2022-11-26 01:14:31,423 INFO L226 Difference]: Without dead ends: 26 [2022-11-26 01:14:31,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 17 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2022-11-26 01:14:31,425 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:14:31,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 14 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:14:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-26 01:14:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-11-26 01:14:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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-26 01:14:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-11-26 01:14:31,444 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2022-11-26 01:14:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:14:31,444 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-11-26 01:14:31,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:14:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-11-26 01:14:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:14:31,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:14:31,445 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2022-11-26 01:14:31,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-26 01:14:31,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-26 01:14:31,646 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:14:31,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:14:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1269137250, now seen corresponding path program 21 times [2022-11-26 01:14:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:14:31,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203800460] [2022-11-26 01:14:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:14:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:14:31,661 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:14:31,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638346945] [2022-11-26 01:14:31,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:14:31,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:14:31,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:14:31,662 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:14:31,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-26 01:14:31,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:14:31,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:14:31,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 01:14:31,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:14:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:14:32,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:14:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:14:32,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:14:32,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203800460] [2022-11-26 01:14:32,642 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:14:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638346945] [2022-11-26 01:14:32,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638346945] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:14:32,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1678387479] [2022-11-26 01:14:32,643 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:14:32,643 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:14:32,643 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:14:32,644 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:14:32,644 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:14:32,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,692 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 01:14:32,692 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-26 01:14:32,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,840 INFO L321 Elim1Store]: treesize reduction 94, result has 27.7 percent of original size [2022-11-26 01:14:32,841 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-26 01:14:32,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,864 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-26 01:14:32,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,898 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-26 01:14:32,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:14:32,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:32,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:33,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:33,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:33,086 INFO L321 Elim1Store]: treesize reduction 214, result has 11.9 percent of original size [2022-11-26 01:14:33,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 32 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 23 case distinctions, treesize of input 434 treesize of output 423 [2022-11-26 01:14:33,156 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-26 01:14:33,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:14:33,225 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:14:33,225 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 39 treesize of output 37 [2022-11-26 01:14:33,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:14:33,287 INFO L321 Elim1Store]: treesize reduction 19, result has 56.8 percent of original size [2022-11-26 01:14:33,287 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 40 treesize of output 38 [2022-11-26 01:14:33,393 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:14:33,393 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 39 treesize of output 57 [2022-11-26 01:14:33,487 INFO L321 Elim1Store]: treesize reduction 29, result has 60.8 percent of original size [2022-11-26 01:14:33,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 40 treesize of output 58 [2022-11-26 01:14:33,521 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:14:34,368 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3878#(and (<= 0 ~N~0) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) |ULTIMATE.start_main_#t~mem13#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= ~N~0 |ULTIMATE.start_main_#t~mem13#1|) 1 0)) (= |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_assume_abort_if_not_~cond#1|) (= |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) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))' at error location [2022-11-26 01:14:34,368 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:14:34,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-26 01:14:34,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2022-11-26 01:14:34,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582409116] [2022-11-26 01:14:34,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-26 01:14:34,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-26 01:14:34,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:14:34,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-26 01:14:34,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2022-11-26 01:14:34,372 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:14:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:14:34,885 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-11-26 01:14:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-26 01:14:34,885 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-26 01:14:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:14:34,886 INFO L225 Difference]: With dead ends: 26 [2022-11-26 01:14:34,886 INFO L226 Difference]: Without dead ends: 23 [2022-11-26 01:14:34,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 17 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2022-11-26 01:14:34,887 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:14:34,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:14:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-26 01:14:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-26 01:14:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 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-26 01:14:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-11-26 01:14:34,907 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2022-11-26 01:14:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:14:34,907 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-11-26 01:14:34,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:14:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-11-26 01:14:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 01:14:34,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:14:34,908 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2022-11-26 01:14:34,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-26 01:14:35,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-26 01:14:35,109 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:14:35,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:14:35,109 INFO L85 PathProgramCache]: Analyzing trace with hash -688440503, now seen corresponding path program 22 times [2022-11-26 01:14:35,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:14:35,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672072362] [2022-11-26 01:14:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:14:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:14:35,125 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-26 01:14:35,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422158417] [2022-11-26 01:14:35,126 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:14:35,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:14:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:14:35,127 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:14:35,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-26 01:14:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:14:35,329 WARN L261 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 124 conjunts are in the unsatisfiable core [2022-11-26 01:14:35,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:14:35,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:14:35,369 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-26 01:14:35,412 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-26 01:14:35,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,498 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-26 01:14:35,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,584 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-26 01:14:35,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2022-11-26 01:14:35,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 69 [2022-11-26 01:14:35,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:35,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 78 [2022-11-26 01:14:36,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 90 [2022-11-26 01:14:36,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 102 [2022-11-26 01:14:36,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 144 [2022-11-26 01:14:36,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-26 01:14:36,542 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 102 treesize of output 74 [2022-11-26 01:14:36,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 151 [2022-11-26 01:14:36,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2022-11-26 01:14:36,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:36,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 109 [2022-11-26 01:14:37,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 109 [2022-11-26 01:14:37,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:14:37,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 112 [2022-11-26 01:14:37,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 159 [2022-11-26 01:14:37,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-26 01:14:37,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-26 01:14:37,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 158 [2022-11-26 01:14:37,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2022-11-26 01:14:37,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-11-26 01:14:38,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2022-11-26 01:14:38,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 49 [2022-11-26 01:14:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:14:38,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:14:38,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:14:38,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (= .cse4 1)) (.cse0 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (and (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 1))) .cse1) (or (not .cse1) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (and (= .cse2 1) (= c_~N~0 (+ .cse3 .cse2 .cse4))))))))))) is different from false [2022-11-26 01:14:38,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse13 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse10 1)) (.cse5 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 1)) (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))))) (.cse4 (+ .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (= c_~N~0 (let ((.cse2 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse1 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)))) (not (= .cse1 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)) .cse5) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= .cse6 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 1)))))) (or (not .cse0) (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse12 (= .cse9 1))) (and (or (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (and (= .cse7 1) (= c_~N~0 (+ .cse8 .cse9 .cse10 .cse7)))) (not .cse12)) (or .cse12 .cse5))))))))))) is different from false [2022-11-26 01:14:41,677 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ .cse21 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse5 (+ .cse21 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)) (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse17 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse17 1)) (.cse12 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse22 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)))) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse23 1)) (= c_~N~0 (let ((.cse24 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse24)))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1)) .cse10))) (.cse6 (+ .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1) (not (= .cse2 1)) (not (= .cse3 1)))))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse7 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= c_~N~0 (+ .cse7 .cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse9)) (not (= .cse8 1)) (not (= .cse9 1)))))) (or .cse10 (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse11))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1) (not (= .cse11 1)))))) (or .cse12 (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) (or (not .cse0) (let ((.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse13 (= .cse16 1))) (and (or (not .cse13) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse20 (= .cse18 1))) (and (or (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (and (= c_~N~0 (+ .cse14 .cse15 .cse16 .cse17 .cse18)) (= .cse14 1))) (not .cse20)) (or .cse20 .cse10))))) (or .cse13 .cse12)))))))))))) is different from false [2022-11-26 01:14:45,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse30 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse14 (+ .cse30 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)))) (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) 1)))) (.cse8 (+ .cse30 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (+ .cse30 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) 1) (not (= .cse38 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1)) .cse9) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= (let ((.cse40 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) .cse39 .cse40)) c_~N~0) (not (= .cse39 1))))))) (.cse26 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse26 1)) (.cse19 (and (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse33 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse31 1)) (= (+ .cse31 .cse32 .cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14)) c_~N~0) (not (= .cse32 1)))))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse36 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse34 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) 1) (not (= .cse35 1)))))) (or (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1) (not (= .cse37 1))))) .cse9) (or (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 1)) .cse1))) (.cse4 (+ .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or .cse1 (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (or (not (= .cse2 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3) 1))))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse6 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (= .cse5 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse6 .cse7 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1) (not (= .cse7 1)))))) .cse9) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse12 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse11 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse10 1)) (not (= .cse11 1)) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse11 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) .cse12 .cse13 .cse11 .cse10)) (not (= .cse13 1))))))) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse16 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse18 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse15 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse18 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14) 1) (not (= .cse18 1)) (not (= .cse17 1))))))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) 1)) .cse19))) (or (not .cse0) (let ((.cse28 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse24 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (let ((.cse20 (= .cse25 1))) (and (or .cse20 .cse19) (or (let ((.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (let ((.cse29 (= .cse27 1))) (and (or (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse24 .cse25 .cse26 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse21 (= .cse23 1))) (and (or .cse9 .cse21) (or (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse24 .cse25 .cse26 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse14))) (and (= .cse22 1) (= c_~N~0 (+ .cse23 .cse22 .cse24 .cse25 .cse26 .cse27)))) (not .cse21))))) (not .cse29)) (or .cse1 .cse29)))) (not .cse20)))))))))))))) is different from false [2022-11-26 01:14:52,604 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse15 (+ .cse40 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1)) (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse5 (+ .cse40 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= c_~N~0 (let ((.cse61 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse61))) (not (= .cse60 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1)) .cse9) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse62 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse62 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1)))))) (.cse6 (+ .cse40 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (and (or .cse24 (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse54 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1) (not (= .cse55 1)) (not (= .cse53 1)))))) (or (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1) (not (= .cse56 1))))) .cse9) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse58 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (+ .cse57 .cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse59) c_~N~0) (not (= .cse59 1)) (not (= .cse57 1)))))))) (.cse7 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse35 1)) (.cse27 (and (or .cse24 (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1) (not (= .cse41 1)))))) (or .cse25 (forall ((v_ArrVal_1705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse43 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1) (not (= .cse42 1)) (not (= .cse44 1)))))) .cse9) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse47 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse45 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1) (not (= .cse46 1)) (not (= .cse48 1))))))) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse49 .cse50 .cse51 .cse52)) (not (= .cse49 1)) (not (= .cse50 1)) (not (= .cse52 1))))))))) (.cse8 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1) (not (= .cse4 1)) (not (= .cse2 1)) (not (= .cse3 1))))))) .cse9) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse13 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse11 .cse12 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse10 1)) (not (= .cse11 1)) (not (= .cse12 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse11 .cse14 .cse12 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1) (not (= .cse14 1)))))))) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse20 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse17 .cse18 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse16 1)) (not (= .cse17 1)) (not (= .cse18 1)) (not (= .cse19 1)) (= c_~N~0 (+ .cse20 .cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse17 .cse19 .cse18 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse19 .cse18 .cse16)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse23 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse21 1)) (not (= .cse22 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) .cse24) (or .cse25 (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse26 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1))))) (or .cse27 (forall ((v_ArrVal_1702 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1))))) (or (not .cse0) (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse39 (= .cse34 1))) (and (or (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse28 (= .cse36 1))) (and (or .cse25 .cse28) (or (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse38 (= .cse31 1))) (and (or (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse33 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse29 (= .cse32 1))) (and (or .cse29 .cse9) (or (not .cse29) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (and (= .cse30 1) (= (+ .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse30) c_~N~0))))))) (not .cse38)) (or .cse38 .cse24)))) (not .cse28))))) (not .cse39)) (or .cse39 .cse27)))))))))))))) is different from false [2022-11-26 01:14:54,639 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse15 (+ .cse40 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1)) (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) (.cse5 (+ .cse40 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= c_~N~0 (let ((.cse61 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse61))) (not (= .cse60 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1)) .cse9) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse62 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse62 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1)))))) (.cse6 (+ .cse40 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (and (or .cse24 (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse54 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse54 .cse55))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1) (not (= .cse55 1)) (not (= .cse53 1)))))) (or (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1) (not (= .cse56 1))))) .cse9) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6)) (.cse58 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse59 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= (+ .cse57 .cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse59) c_~N~0) (not (= .cse59 1)) (not (= .cse57 1)))))))) (.cse7 (+ .cse40 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse35 1)) (.cse27 (and (or .cse24 (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1) (not (= .cse41 1)))))) (or .cse25 (forall ((v_ArrVal_1705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse43 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1) (not (= .cse42 1)) (not (= .cse44 1)))))) .cse9) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse47 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse46 .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse45 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse45 .cse46 .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1) (not (= .cse46 1)) (not (= .cse48 1))))))) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse51 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse50 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse49 .cse50 .cse51 .cse52)) (not (= .cse49 1)) (not (= .cse50 1)) (not (= .cse52 1))))))))) (.cse8 (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse1 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) 1) (not (= .cse4 1)) (not (= .cse2 1)) (not (= .cse3 1))))))) .cse9) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse13 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse11 .cse12 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse10 1)) (not (= .cse11 1)) (not (= .cse12 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse11 .cse14 .cse12 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) 1) (not (= .cse14 1)))))))) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse20 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse19 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse17 .cse18 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (or (not (= .cse16 1)) (not (= .cse17 1)) (not (= .cse18 1)) (not (= .cse19 1)) (= c_~N~0 (+ .cse20 .cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse17 .cse19 .cse18 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15) .cse19 .cse18 .cse16)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse23 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse21 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse21 1)) (not (= .cse22 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse23 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) .cse24) (or .cse25 (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse26 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1))))) (or .cse27 (forall ((v_ArrVal_1702 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1))))) (or (not .cse0) (let ((.cse37 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse33 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse39 (= .cse34 1))) (and (or (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse28 (= .cse36 1))) (and (or .cse25 .cse28) (or (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse33 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse38 (= .cse31 1))) (and (or (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse33 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (let ((.cse29 (= .cse32 1))) (and (or .cse29 .cse9) (or (not .cse29) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse32 .cse33 .cse34 .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15))) (and (= .cse30 1) (= (+ .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse30) c_~N~0))))))) (not .cse38)) (or .cse38 .cse24)))) (not .cse28))))) (not .cse39)) (or .cse39 .cse27)))))))))))))) is different from true [2022-11-26 01:15:07,790 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse51 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse16 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (let ((.cse19 (+ .cse51 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1))))) (let ((.cse20 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse89 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse89 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1)))) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (= c_~N~0 (let ((.cse91 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse90 .cse91))) (not (= .cse90 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)) .cse18))) (.cse21 (+ .cse51 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (and (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse83 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (= (+ .cse82 .cse83 .cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) c_~N~0) (not (= .cse83 1)) (not (= .cse84 1)))))) (or .cse18 (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse85 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse85 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1))))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse87 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse86 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse86 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse86 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1) (not (= .cse88 1)))))) (or .cse20 (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1))))) (.cse23 (+ .cse51 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (+ .cse51 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (and (or (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse70 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= .cse70 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1)))) .cse20) (or (forall ((v_ArrVal_1705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 1)) .cse22) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse74 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse71 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse71 1)) (not (= .cse72 1)) (not (= .cse73 1)) (= (+ .cse72 .cse74 .cse71 .cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse74 .cse71 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) c_~N~0)))))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse76 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse75 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse75 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse75 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse77 1)))))) .cse18) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse81 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse80 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse79 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse78 1)) (not (= .cse79 1)) (not (= .cse80 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse81 .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1)))))))) (.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse12 1)) (.cse1 (and (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse53 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse54 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse52 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse54 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1) (not (= .cse56 1)) (not (= .cse55 1)) (not (= .cse54 1)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse59 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse57 1)) (not (= .cse58 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse57 .cse60 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse60 1))))))) .cse18) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse63 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse62 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= .cse61 1)) (not (= .cse62 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1))))) .cse20) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 1) (not (= .cse64 1))))) .cse22) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse66 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse65 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse65 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse65 .cse67 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse65 1)) (= c_~N~0 (+ .cse66 .cse65 .cse67 .cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse65 .cse67 .cse68 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse69)) (not (= .cse69 1)) (not (= .cse68 1)) (not (= .cse67 1)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) 1)) .cse4))) (.cse25 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (not .cse0) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse2 (= .cse10 1))) (and (or .cse1 .cse2) (or (not .cse2) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse3 (= .cse13 1))) (and (or .cse3 .cse4) (or (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse5 (= .cse7 1))) (and (or (not .cse5) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse6 (= .cse8 1))) (and (or (not .cse6) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (let ((.cse17 (= .cse14 1))) (and (or (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (and (= c_~N~0 (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (= .cse11 1))) (not .cse17)) (or .cse17 .cse18))))) (or .cse20 .cse6))))) (or .cse5 .cse22)))) (not .cse3)))))))))))) (or .cse0 (and (or .cse20 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse28 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= .cse26 1)) (not (= .cse27 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1) (not (= .cse29 1)))))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse34 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34 .cse35 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse30 .cse34 .cse35 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse30 1)) (not (= .cse31 1)) (not (= .cse32 1)) (not (= .cse33 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse30 .cse34 .cse35 .cse31 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1) (not (= .cse35 1))))))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse40 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse40 .cse41 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse36 .cse40 .cse41 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse36 1)) (not (= .cse37 1)) (not (= .cse38 1)) (not (= .cse39 1)) (= (+ .cse38 .cse36 .cse40 .cse41 .cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse36 .cse40 .cse41 .cse37 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse39) c_~N~0) (not (= .cse41 1))))))))) (or .cse1 (forall ((v_ArrVal_1699 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25) 1))) (or .cse4 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (or (not (= .cse42 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) 1))))) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse44 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (not (= .cse43 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 1) (not (= .cse45 1)))))) .cse22) (or .cse18 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse50 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse46 1)) (not (= .cse47 1)) (not (= .cse48 1)) (not (= .cse49 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse46 .cse50 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)))))))))))))))))) is different from false [2022-11-26 01:15:09,807 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse51 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse16 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (let ((.cse19 (+ .cse51 20 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse18 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1))))) (let ((.cse20 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse89 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse89 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1)))) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (= c_~N~0 (let ((.cse91 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse90 .cse91))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse90 .cse91))) (not (= .cse90 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)) .cse18))) (.cse21 (+ .cse51 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (and (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse82 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse83 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (= (+ .cse82 .cse83 .cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse82 .cse83 .cse84))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) c_~N~0) (not (= .cse83 1)) (not (= .cse84 1)))))) (or .cse18 (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse85 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse85 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse85))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1))))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse87 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse86 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse86))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse86 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse86 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1) (not (= .cse88 1)))))) (or .cse20 (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1))))) (.cse23 (+ .cse51 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse24 (+ .cse51 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (and (or (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse70 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= .cse70 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1)))) .cse20) (or (forall ((v_ArrVal_1705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 1)) .cse22) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse74 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse71 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse71 1)) (not (= .cse72 1)) (not (= .cse73 1)) (= (+ .cse72 .cse74 .cse71 .cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse72 .cse74 .cse71 .cse73))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16)) c_~N~0)))))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse76 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse75 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse75 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse75 .cse77))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse77 1)))))) .cse18) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse81 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse80 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse79 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse78 1)) (not (= .cse79 1)) (not (= .cse80 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse81 .cse78 .cse80))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1)))))))) (.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse12 1)) (.cse1 (and (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse53 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse54 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse54 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse52 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse53 .cse52 .cse54 .cse55 .cse56))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1) (not (= .cse56 1)) (not (= .cse55 1)) (not (= .cse54 1)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse59 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse57 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse57 1)) (not (= .cse58 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse59 .cse57 .cse60 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse60 1))))))) .cse18) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse63 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse62 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse61 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= .cse61 1)) (not (= .cse62 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse63 .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1))))) .cse20) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 1) (not (= .cse64 1))))) .cse22) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse66 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse65 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse65 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse65 .cse67 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse65 1)) (= c_~N~0 (+ .cse66 .cse65 .cse67 .cse68 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse65 .cse67 .cse68 .cse69))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse69)) (not (= .cse69 1)) (not (= .cse68 1)) (not (= .cse67 1)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) 1)) .cse4))) (.cse25 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or (not .cse0) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse2 (= .cse10 1))) (and (or .cse1 .cse2) (or (not .cse2) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse3 (= .cse13 1))) (and (or .cse3 .cse4) (or (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse5 (= .cse7 1))) (and (or (not .cse5) (let ((.cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse9 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse6 (= .cse8 1))) (and (or (not .cse6) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (let ((.cse17 (= .cse14 1))) (and (or (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16))) (and (= c_~N~0 (+ .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) (= .cse11 1))) (not .cse17)) (or .cse17 .cse18))))) (or .cse20 .cse6))))) (or .cse5 .cse22)))) (not .cse3)))))))))))) (or .cse0 (and (or .cse20 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse28 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse27 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (or (not (= .cse26 1)) (not (= .cse27 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28 .cse29 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21) 1) (not (= .cse29 1)))))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse34 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse32 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse30 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse34 .cse35 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse33 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse30 .cse34 .cse35 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse30 1)) (not (= .cse31 1)) (not (= .cse32 1)) (not (= .cse33 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse30 .cse34 .cse35 .cse31 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) 1) (not (= .cse35 1))))))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse40 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse41 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse36 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse40 .cse41 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (let ((.cse39 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse36 .cse40 .cse41 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (or (not (= .cse36 1)) (not (= .cse37 1)) (not (= .cse38 1)) (not (= .cse39 1)) (= (+ .cse38 .cse36 .cse40 .cse41 .cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 .cse36 .cse40 .cse41 .cse37 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse16) .cse39) c_~N~0) (not (= .cse41 1))))))))) (or .cse1 (forall ((v_ArrVal_1699 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25) 1))) (or .cse4 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (or (not (= .cse42 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24) 1))))) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse44 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse45 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (or (not (= .cse43 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23) 1) (not (= .cse45 1)))))) .cse22) (or .cse18 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse50 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse47 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse25))) (let ((.cse49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse24))) (let ((.cse48 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse23))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse50 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse21))) (or (not (= .cse46 1)) (not (= .cse47 1)) (not (= .cse48 1)) (not (= .cse49 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse48 .cse46 .cse50 .cse49 .cse47))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)))))))))))))))))) is different from true [2022-11-26 01:15:41,651 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse63 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse19 (+ .cse63 28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)))) (.cse20 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (let ((.cse11 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse126 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= c_~N~0 (let ((.cse127 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse126 .cse127 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse126 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (not (= .cse126 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1)) .cse21) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse128 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse128 1)) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse128 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))))))) (.cse6 (+ .cse63 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (and (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse120 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse121 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse119 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse120 .cse121))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse119 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse119 .cse120 .cse121))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse121 1)))))) (or .cse21 (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse122 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse122 1)))))) (or .cse11 (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse125 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse124 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse123 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse125 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse123 1)) (not (= .cse124 1)) (= c_~N~0 (+ .cse123 .cse125 .cse124 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse123 .cse125 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))))))))) (.cse7 (+ .cse63 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse37 (and (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse110 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse109 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse107 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse109 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= (+ .cse107 .cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 .cse108 .cse109 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse109 .cse110) c_~N~0) (not (= .cse108 1)) (not (= .cse109 1)) (not (= .cse107 1))))))) (or .cse11 (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse111 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse111 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse111 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse113 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse115 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse114 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse112 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse112 .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse113 1)) (not (= .cse114 1)) (not (= .cse112 1))))))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1)) .cse32) (or .cse21 (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse116 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse118 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse117 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse116 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse116 .cse117 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse116 1)) (not (= .cse117 1))))))))) (.cse8 (+ .cse63 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse39 (and (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse89 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse90 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse92 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse91 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse93 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= c_~N~0 (+ .cse89 .cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse92 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse91 .cse92 .cse93)) (not (= .cse89 1)) (not (= .cse91 1)) (not (= .cse92 1)) (not (= .cse93 1)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse94 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse94 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1)))) .cse32) (or (forall ((v_ArrVal_1702 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1)) .cse37) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse95 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse99 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse97 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse96 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse98 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse96 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse95 1)) (not (= .cse96 1)) (not (= .cse97 1)) (not (= .cse98 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse96 .cse97 .cse98))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse100 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse101 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse103 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse102 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse100 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101 .cse102 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse102 1)) (not (= .cse103 1))))))) .cse21) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse104 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse106 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse105 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse104 1)) (not (= .cse105 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106 .cse105))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) .cse11))) (.cse9 (+ .cse63 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse57 1)) (.cse33 (and (or .cse37 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= .cse64 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse68 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse70 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse66 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse65 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67 .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse69 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67 .cse68 .cse65 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse65 1)) (= (+ .cse66 .cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67 .cse68 .cse69 .cse65 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse68 .cse69 .cse65 .cse70) c_~N~0) (not (= .cse70 1)) (not (= .cse66 1)) (not (= .cse67 1)) (not (= .cse69 1))))))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse76 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse74 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse76 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse76 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse75 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse76 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse71 1)) (not (= .cse72 1)) (not (= .cse73 1)) (not (= .cse74 1)) (not (= .cse75 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse76 .cse75 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)))))))) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse81 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse80 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse79 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse77 1)) (not (= .cse78 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse79 1)) (not (= .cse80 1)))))))) .cse21) (or .cse39 (forall ((v_ArrVal_1699 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 1))) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse85 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse82 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse83 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 .cse85 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse82 1)) (not (= .cse83 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse84 .cse85 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1) (not (= .cse84 1))))))) .cse11) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse87 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse86 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1) (not (= .cse88 1)) (not (= .cse86 1)))))) .cse32))) (.cse10 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse5 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse5 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1) (not (= .cse4 1)))))))) .cse11) (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse17 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse13 .cse17 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse13 .cse17 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse12 1)) (not (= .cse13 1)) (not (= .cse14 1)) (not (= .cse15 1)) (= c_~N~0 (+ .cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse13 .cse17 .cse12 .cse18 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse14 .cse13 .cse17 .cse12 .cse18 .cse15)) (not (= .cse16 1)) (not (= .cse18 1)))))))))) (or .cse21 (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse27 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse23 .cse27 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse22 1)) (not (= .cse23 1)) (not (= .cse24 1)) (not (= .cse25 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse24 .cse23 .cse27 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse26 1)))))))))) (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse30 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse28 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1) (not (= .cse31 1)) (not (= .cse29 1))))))) .cse32) (or (forall ((v_ArrVal_1696 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 1)) .cse33) (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse36 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= .cse34 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1) (not (= .cse35 1)))))) .cse37) (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse38 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 1)))) .cse39) (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse45 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse41 .cse45 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse42 .cse41 .cse45 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse40 1)) (not (= .cse41 1)) (not (= .cse42 1)) (not (= .cse43 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse42 .cse41 .cse45 .cse40 .cse46 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse44 1)) (not (= .cse46 1)))))))))))) (or (not .cse0) (let ((.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse47 (= .cse55 1))) (and (or .cse47 .cse33) (or (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse62 (= .cse58 1))) (and (or (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse48 (= .cse52 1))) (and (or (not .cse48) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse54 .cse55 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse49 (= .cse53 1))) (and (or (not .cse49) (let ((.cse59 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse50 (= .cse59 1))) (and (or .cse50 .cse11) (or (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (let ((.cse51 (= .cse56 1))) (and (or .cse21 .cse51) (or (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (and (= c_~N~0 (+ .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60)) (= .cse60 1))) (not .cse51))))) (not .cse50)))))) (or .cse49 .cse32))))) (or .cse48 .cse37)))) (not .cse62)) (or .cse39 .cse62)))) (not .cse47))))))))))))))))) is different from false [2022-11-26 01:15:43,735 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse63 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse19 (+ .cse63 28 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse21 (and (forall ((v_ArrVal_1715 (Array Int Int))) (= c_~N~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) (select v_ArrVal_1715 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (forall ((v_ArrVal_1715 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1715) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)))) (.cse20 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (let ((.cse11 (and (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse126 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= c_~N~0 (let ((.cse127 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse126 .cse127 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse126 .cse127))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))) (not (= .cse126 1))))) (or (forall ((v_ArrVal_1711 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1)) .cse21) (forall ((v_ArrVal_1711 (Array Int Int))) (let ((.cse128 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse128 1)) (= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse128 (select v_ArrVal_1711 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))))))) (.cse6 (+ .cse63 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (and (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse120 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse121 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse119 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse120 .cse121))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse119 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse119 .cse120 .cse121))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse121 1)))))) (or .cse21 (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse122 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse122))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse122 1)))))) (or .cse11 (forall ((v_ArrVal_1709 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))) (forall ((v_ArrVal_1709 (Array Int Int))) (let ((.cse125 (select v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse124 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1709) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse123 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse125 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse123 1)) (not (= .cse124 1)) (= c_~N~0 (+ .cse123 .cse125 .cse124 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1709 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse123 .cse125 .cse124))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))))))))) (.cse7 (+ .cse63 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse37 (and (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse110 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse109 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse107 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse108 .cse109 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= (+ .cse107 .cse108 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse107 .cse108 .cse109 .cse110))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse109 .cse110) c_~N~0) (not (= .cse108 1)) (not (= .cse109 1)) (not (= .cse107 1))))))) (or .cse11 (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse111 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse111 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse111 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse113 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse115 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse114 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse112 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse112 .cse113 .cse114 .cse115))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse113 1)) (not (= .cse114 1)) (not (= .cse112 1))))))) (or (forall ((v_ArrVal_1705 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1)) .cse32) (or .cse21 (forall ((v_ArrVal_1705 (Array Int Int))) (let ((.cse116 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1705) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) (.cse118 (select v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse117 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse116 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1705 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse116 .cse117 .cse118))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse116 1)) (not (= .cse117 1))))))))) (.cse8 (+ .cse63 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse39 (and (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse89 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse90 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse92 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse91 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse93 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse92))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (= c_~N~0 (+ .cse89 .cse90 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse89 .cse90 .cse91 .cse92 .cse93))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse91 .cse92 .cse93)) (not (= .cse89 1)) (not (= .cse91 1)) (not (= .cse92 1)) (not (= .cse93 1)))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse94 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse94 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse94 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1)))) .cse32) (or (forall ((v_ArrVal_1702 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1)) .cse37) (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse95 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse99 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse97 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse96 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse98 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse96 .cse97))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse95 1)) (not (= .cse96 1)) (not (= .cse97 1)) (not (= .cse98 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse95 .cse99 .cse96 .cse97 .cse98))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1))))))) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse100 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse101 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse103 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse102 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse100 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse100 .cse101 .cse102 .cse103))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse102 1)) (not (= .cse103 1))))))) .cse21) (or (forall ((v_ArrVal_1702 (Array Int Int))) (let ((.cse104 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1702) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8)) (.cse106 (select v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse105 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse104 1)) (not (= .cse105 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1702 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse104 .cse106 .cse105))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1))))) .cse11))) (.cse9 (+ .cse63 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (= .cse57 1)) (.cse33 (and (or .cse37 (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse64 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= .cse64 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|) .cse64))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse68 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse70 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse66 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse65 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67 .cse68 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse69 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67 .cse68 .cse65 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse65 1)) (= (+ .cse66 .cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse66 .cse67 .cse68 .cse69 .cse65 .cse70))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse68 .cse69 .cse65 .cse70) c_~N~0) (not (= .cse70 1)) (not (= .cse66 1)) (not (= .cse67 1)) (not (= .cse69 1))))))))) (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse76 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse72 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse74 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse73 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse74 .cse76 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse76 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse75 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse76 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse71 1)) (not (= .cse72 1)) (not (= .cse73 1)) (not (= .cse74 1)) (not (= .cse75 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse73 .cse74 .cse76 .cse75 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1)))))))) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse81 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse78 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse80 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse81 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse79 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse80 .cse81 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse77 1)) (not (= .cse78 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse79 .cse80 .cse81 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse79 1)) (not (= .cse80 1)))))))) .cse21) (or .cse39 (forall ((v_ArrVal_1699 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 1))) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse85 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse82 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse84 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse85 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse83 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse84 .cse85 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse82 1)) (not (= .cse83 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse83 .cse84 .cse85 .cse82))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1) (not (= .cse84 1))))))) .cse11) (or (forall ((v_ArrVal_1699 (Array Int Int))) (let ((.cse87 (select v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse88 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1699) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse86 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1699 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse86 .cse87 .cse88))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1) (not (= .cse88 1)) (not (= .cse86 1)))))) .cse32))) (.cse10 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (or .cse0 (and (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse5 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (or (not (= .cse1 1)) (not (= .cse2 1)) (not (= .cse3 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse5 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) 1) (not (= .cse4 1)))))))) .cse11) (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse17 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse12 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse13 .cse17 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse18 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse13 .cse17 .cse12 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse12 1)) (not (= .cse13 1)) (not (= .cse14 1)) (not (= .cse15 1)) (= c_~N~0 (+ .cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse14 .cse13 .cse17 .cse12 .cse18 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) .cse14 .cse13 .cse17 .cse12 .cse18 .cse15)) (not (= .cse16 1)) (not (= .cse18 1)))))))))) (or .cse21 (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse27 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse22 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse23 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse27 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse23 .cse27 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (or (not (= .cse22 1)) (not (= .cse23 1)) (not (= .cse24 1)) (not (= .cse25 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse24 .cse23 .cse27 .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20) 1) (not (= .cse26 1)))))))))) (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse29 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse30 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse28 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse31 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (or (not (= .cse28 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) 1) (not (= .cse31 1)) (not (= .cse29 1))))))) .cse32) (or (forall ((v_ArrVal_1696 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10) 1)) .cse33) (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse35 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse36 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse34 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (or (not (= .cse34 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse35 .cse36 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8) 1) (not (= .cse35 1)))))) .cse37) (or (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse38 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (or (not (= .cse38 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse38 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 1)))) .cse39) (forall ((v_ArrVal_1696 (Array Int Int))) (let ((.cse44 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10)) (.cse45 (select v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse40 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse43 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse42 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse41 .cse45 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse46 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse42 .cse41 .cse45 .cse40 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (or (not (= .cse40 1)) (not (= .cse41 1)) (not (= .cse42 1)) (not (= .cse43 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store v_ArrVal_1696 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse42 .cse41 .cse45 .cse40 .cse46 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19) 1) (not (= .cse44 1)) (not (= .cse46 1)))))))))))) (or (not .cse0) (let ((.cse61 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse47 (= .cse55 1))) (and (or .cse47 .cse33) (or (let ((.cse58 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9))) (let ((.cse62 (= .cse58 1))) (and (or (let ((.cse52 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse55 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse48 (= .cse52 1))) (and (or (not .cse48) (let ((.cse53 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse54 .cse55 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse49 (= .cse53 1))) (and (or (not .cse49) (let ((.cse59 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse57 .cse58))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse50 (= .cse59 1))) (and (or .cse50 .cse11) (or (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse20))) (let ((.cse51 (= .cse56 1))) (and (or .cse21 .cse51) (or (let ((.cse60 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse61 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19))) (and (= c_~N~0 (+ .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60)) (= .cse60 1))) (not .cse51))))) (not .cse50)))))) (or .cse49 .cse32))))) (or .cse48 .cse37)))) (not .cse62)) (or .cse39 .cse62)))) (not .cse47))))))))))))))))) is different from true [2022-11-26 01:16:12,650 WARN L230 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-11-26 01:16:12,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-11-26 01:16:12,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:16:12,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672072362] [2022-11-26 01:16:12,651 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:16:12,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422158417] [2022-11-26 01:16:12,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2022-11-26 01:16:12,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1120545293] [2022-11-26 01:16:12,653 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:16:12,653 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:16:12,653 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:16:12,653 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:16:12,653 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:16:12,655 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 44 more [2022-11-26 01:16:12,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:16:12,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2022-11-26 01:16:12,659 ERROR L170 FreeRefinementEngine]: Strategy SIFA_TAIPAN failed to provide any proof altough trace is infeasible [2022-11-26 01:16:12,659 INFO L360 BasicCegarLoop]: Counterexample might be feasible [2022-11-26 01:16:12,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 01:16:12,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:12,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:16:12,873 INFO L445 BasicCegarLoop]: Path program histogram: [22, 1, 1] [2022-11-26 01:16:12,876 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 01:16:12,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 01:16:12 BoogieIcfgContainer [2022-11-26 01:16:12,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 01:16:12,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 01:16:12,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 01:16:12,893 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 01:16:12,893 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:10:12" (3/4) ... [2022-11-26 01:16:12,896 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-26 01:16:12,896 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 01:16:12,896 INFO L158 Benchmark]: Toolchain (without parser) took 361264.41ms. Allocated memory was 138.4MB in the beginning and 327.2MB in the end (delta: 188.7MB). Free memory was 75.1MB in the beginning and 138.3MB in the end (delta: -63.2MB). Peak memory consumption was 127.2MB. Max. memory is 16.1GB. [2022-11-26 01:16:12,896 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:16:12,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.09ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 75.0MB in the beginning and 153.1MB in the end (delta: -78.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-11-26 01:16:12,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.22ms. Allocated memory is still 188.7MB. Free memory was 153.1MB in the beginning and 151.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:16:12,897 INFO L158 Benchmark]: Boogie Preprocessor took 48.07ms. Allocated memory is still 188.7MB. Free memory was 151.5MB in the beginning and 150.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 01:16:12,897 INFO L158 Benchmark]: RCFGBuilder took 409.17ms. Allocated memory is still 188.7MB. Free memory was 150.0MB in the beginning and 135.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 01:16:12,897 INFO L158 Benchmark]: TraceAbstraction took 360423.04ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 134.8MB in the beginning and 138.3MB in the end (delta: -3.6MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. [2022-11-26 01:16:12,897 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 327.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 01:16:12,898 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.09ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 75.0MB in the beginning and 153.1MB in the end (delta: -78.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.22ms. Allocated memory is still 188.7MB. Free memory was 153.1MB in the beginning and 151.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.07ms. Allocated memory is still 188.7MB. Free memory was 151.5MB in the beginning and 150.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.17ms. Allocated memory is still 188.7MB. Free memory was 150.0MB in the beginning and 135.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 360423.04ms. Allocated memory was 188.7MB in the beginning and 327.2MB in the end (delta: 138.4MB). Free memory was 134.8MB in the beginning and 138.3MB in the end (delta: -3.6MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 327.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L19] int N; [L23] N = __VERIFIER_nondet_int() [L24] COND FALSE !(N <= 0) [L25] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L13] COND TRUE !cond [L25] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L27] int i; [L28] int sum[1]; [L29] int *a = malloc(sizeof(int)*N); [L31] sum[0] = 0 [L32] i=0 [L32] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur 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 -> 1a3387bc5e2da462b89ff029159e07dcc81e24b9a3389e54a743d70d22e0e9eb [2022-11-26 01:16:15,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:16:15,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:16:15,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:16:15,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:16:15,588 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:16:15,590 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/array-fpi/s1if.c [2022-11-26 01:16:18,852 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:16:19,066 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:16:19,067 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/sv-benchmarks/c/array-fpi/s1if.c [2022-11-26 01:16:19,077 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/data/0ed035a76/7ba2c33aad4d4ac09fa68b125043b8be/FLAGf95aede6a [2022-11-26 01:16:19,092 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/data/0ed035a76/7ba2c33aad4d4ac09fa68b125043b8be [2022-11-26 01:16:19,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:16:19,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:16:19,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:16:19,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:16:19,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:16:19,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319d7251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19, skipping insertion in model container [2022-11-26 01:16:19,103 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:16:19,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:16:19,317 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_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/sv-benchmarks/c/array-fpi/s1if.c[587,600] [2022-11-26 01:16:19,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:16:19,363 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:16:19,381 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_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/sv-benchmarks/c/array-fpi/s1if.c[587,600] [2022-11-26 01:16:19,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:16:19,421 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:16:19,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19 WrapperNode [2022-11-26 01:16:19,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:16:19,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:16:19,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:16:19,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:16:19,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,483 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-11-26 01:16:19,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:16:19,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:16:19,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:16:19,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:16:19,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:16:19,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:16:19,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:16:19,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:16:19,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (1/1) ... [2022-11-26 01:16:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:16:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:16:19,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:16:19,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:16:19,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 01:16:19,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 01:16:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:16:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 01:16:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-26 01:16:19,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:16:19,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:16:19,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:16:19,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-26 01:16:19,712 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:16:19,714 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:16:19,897 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:16:19,903 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:16:19,904 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 01:16:19,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:16:19 BoogieIcfgContainer [2022-11-26 01:16:19,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:16:19,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:16:19,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:16:19,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:16:19,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:16:19" (1/3) ... [2022-11-26 01:16:19,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e86613a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:16:19, skipping insertion in model container [2022-11-26 01:16:19,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:16:19" (2/3) ... [2022-11-26 01:16:19,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e86613a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:16:19, skipping insertion in model container [2022-11-26 01:16:19,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:16:19" (3/3) ... [2022-11-26 01:16:19,916 INFO L112 eAbstractionObserver]: Analyzing ICFG s1if.c [2022-11-26 01:16:19,936 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:16:19,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 01:16:20,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:16:20,017 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;@27e7a28a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:16:20,017 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 01:16:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:16:20,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:16:20,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:16:20,028 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:16:20,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:16:20,033 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2022-11-26 01:16:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:16:20,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123937027] [2022-11-26 01:16:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:16:20,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:20,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:16:20,072 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:16:20,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-26 01:16:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:16:20,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-26 01:16:20,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:20,256 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-26 01:16:20,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:16:20,257 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:16:20,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123937027] [2022-11-26 01:16:20,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123937027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:16:20,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:16:20,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:16:20,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322391601] [2022-11-26 01:16:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:16:20,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 01:16:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:16:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 01:16:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:16:20,302 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 01:16:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:16:20,315 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-11-26 01:16:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 01:16:20,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-26 01:16:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:16:20,325 INFO L225 Difference]: With dead ends: 34 [2022-11-26 01:16:20,325 INFO L226 Difference]: Without dead ends: 15 [2022-11-26 01:16:20,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 01:16:20,331 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:16:20,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:16:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-26 01:16:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-26 01:16:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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-26 01:16:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-11-26 01:16:20,363 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-11-26 01:16:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:16:20,364 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-11-26 01:16:20,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 01:16:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-11-26 01:16:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 01:16:20,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:16:20,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:16:20,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:20,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:20,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:16:20,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:16:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2022-11-26 01:16:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:16:20,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623295123] [2022-11-26 01:16:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:16:20,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:20,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:16:20,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:16:20,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-26 01:16:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:16:20,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 01:16:20,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:20,857 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-26 01:16:20,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 01:16:20,857 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:16:20,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623295123] [2022-11-26 01:16:20,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623295123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:16:20,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:16:20,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 01:16:20,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643738636] [2022-11-26 01:16:20,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:16:20,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:16:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:16:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:16:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:16:20,862 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 01:16:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:16:21,031 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-11-26 01:16:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:16:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-26 01:16:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:16:21,034 INFO L225 Difference]: With dead ends: 28 [2022-11-26 01:16:21,034 INFO L226 Difference]: Without dead ends: 20 [2022-11-26 01:16:21,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:16:21,036 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:16:21,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 8 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:16:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-26 01:16:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2022-11-26 01:16:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-26 01:16:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-11-26 01:16:21,043 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-11-26 01:16:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:16:21,044 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-11-26 01:16:21,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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-26 01:16:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-11-26 01:16:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 01:16:21,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:16:21,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:16:21,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-26 01:16:21,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:21,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:16:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:16:21,257 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2022-11-26 01:16:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:16:21,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436638115] [2022-11-26 01:16:21,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:16:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:16:21,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:16:21,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-26 01:16:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:16:21,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-26 01:16:21,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:21,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 01:16:21,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:16:21,545 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 23 treesize of output 22 [2022-11-26 01:16:21,856 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-26 01:16:22,054 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 43 treesize of output 23 [2022-11-26 01:16:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:22,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:25,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:16:25,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:25,388 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:16:25,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436638115] [2022-11-26 01:16:25,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436638115] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:25,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [622127863] [2022-11-26 01:16:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:16:25,389 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:16:25,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:16:25,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:16:25,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-26 01:16:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:16:25,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-26 01:16:25,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:25,599 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-26 01:16:25,787 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:16:25,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-26 01:16:25,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:16:26,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:16:26,376 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 44 treesize of output 27 [2022-11-26 01:16:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:26,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:32,332 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:16:32,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-26 01:16:32,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:16:32,349 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 24 treesize of output 16 [2022-11-26 01:16:32,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-26 01:16:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:32,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [622127863] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:32,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413161203] [2022-11-26 01:16:32,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:16:32,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:16:32,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:16:32,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:16:32,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:16:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:16:32,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-26 01:16:32,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:32,506 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-26 01:16:32,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:16:32,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:16:33,015 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 44 treesize of output 27 [2022-11-26 01:16:33,709 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 43 treesize of output 23 [2022-11-26 01:16:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:33,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:38,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:16:38,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-26 01:16:38,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:16:38,311 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 24 treesize of output 16 [2022-11-26 01:16:38,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-26 01:16:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:38,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413161203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:38,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 01:16:38,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9, 10, 10, 11] total 33 [2022-11-26 01:16:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750588247] [2022-11-26 01:16:38,340 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 01:16:38,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 01:16:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:16:38,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 01:16:38,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=868, Unknown=4, NotChecked=0, Total=1056 [2022-11-26 01:16:38,343 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:43,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:16:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:16:44,500 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-11-26 01:16:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 01:16:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-26 01:16:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:16:44,502 INFO L225 Difference]: With dead ends: 36 [2022-11-26 01:16:44,502 INFO L226 Difference]: Without dead ends: 27 [2022-11-26 01:16:44,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=377, Invalid=1599, Unknown=4, NotChecked=0, Total=1980 [2022-11-26 01:16:44,506 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:16:44,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 45 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 291 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-11-26 01:16:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-26 01:16:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-11-26 01:16:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-11-26 01:16:44,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2022-11-26 01:16:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:16:44,513 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-11-26 01:16:44,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-11-26 01:16:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 01:16:44,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:16:44,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:16:44,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-26 01:16:44,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:44,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:45,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 01:16:45,121 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:16:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:16:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2022-11-26 01:16:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:16:45,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204091241] [2022-11-26 01:16:45,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 01:16:45,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:45,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:16:45,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:16:45,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-26 01:16:45,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 01:16:45,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:16:45,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 01:16:45,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:45,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:45,863 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:16:45,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204091241] [2022-11-26 01:16:45,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204091241] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:45,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1259764672] [2022-11-26 01:16:45,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 01:16:45,864 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:16:45,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:16:45,865 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:16:45,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-26 01:16:45,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 01:16:45,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:16:45,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 01:16:45,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:46,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:46,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1259764672] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728791712] [2022-11-26 01:16:46,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-26 01:16:46,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:16:46,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:16:46,215 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:16:46,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 01:16:46,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-26 01:16:46,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:16:46,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 01:16:46,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:46,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:46,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728791712] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:46,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 01:16:46,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11, 9, 8, 7] total 25 [2022-11-26 01:16:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865898605] [2022-11-26 01:16:46,636 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 01:16:46,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-26 01:16:46,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:16:46,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-26 01:16:46,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-11-26 01:16:46,639 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:16:47,787 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-11-26 01:16:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 01:16:47,788 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-26 01:16:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:16:47,789 INFO L225 Difference]: With dead ends: 54 [2022-11-26 01:16:47,789 INFO L226 Difference]: Without dead ends: 47 [2022-11-26 01:16:47,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=967, Unknown=0, NotChecked=0, Total=1332 [2022-11-26 01:16:47,791 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 137 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 01:16:47,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 23 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 01:16:47,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-26 01:16:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-11-26 01:16:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 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-26 01:16:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-11-26 01:16:47,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2022-11-26 01:16:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:16:47,803 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-11-26 01:16:47,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-11-26 01:16:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 01:16:47,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:16:47,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:16:47,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:48,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:48,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:48,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:48,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:16:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:16:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2022-11-26 01:16:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:16:48,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889334029] [2022-11-26 01:16:48,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:16:48,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:48,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:16:48,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:16:48,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-26 01:16:48,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:16:48,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:16:48,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:16:48,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:48,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:48,861 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:16:48,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889334029] [2022-11-26 01:16:48,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889334029] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:48,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [407096881] [2022-11-26 01:16:48,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:16:48,861 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:16:48,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:16:48,862 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:16:48,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-26 01:16:49,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:16:49,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:16:49,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 01:16:49,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:49,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:49,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [407096881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:49,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516112073] [2022-11-26 01:16:49,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:16:49,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:16:49,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:16:49,173 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:16:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 01:16:49,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:16:49,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:16:49,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 01:16:49,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:49,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:16:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516112073] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:16:49,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 01:16:49,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9, 7, 8, 7] total 17 [2022-11-26 01:16:49,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35627314] [2022-11-26 01:16:49,440 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 01:16:49,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 01:16:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:16:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 01:16:49,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-26 01:16:49,442 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:16:50,100 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-11-26 01:16:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 01:16:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-26 01:16:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:16:50,102 INFO L225 Difference]: With dead ends: 46 [2022-11-26 01:16:50,102 INFO L226 Difference]: Without dead ends: 34 [2022-11-26 01:16:50,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:16:50,103 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:16:50,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 23 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 01:16:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-26 01:16:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-11-26 01:16:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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-26 01:16:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-26 01:16:50,112 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 19 [2022-11-26 01:16:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:16:50,112 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-26 01:16:50,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:16:50,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-26 01:16:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:16:50,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:16:50,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:16:50,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:50,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:50,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 01:16:50,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:16:50,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:16:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:16:50,715 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2022-11-26 01:16:50,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:16:50,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394485607] [2022-11-26 01:16:50,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:16:50,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:16:50,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:16:50,716 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:16:50,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-26 01:16:50,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:16:50,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:16:50,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-26 01:16:50,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:16:50,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-26 01:16:50,899 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-26 01:16:50,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:16:51,027 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 23 treesize of output 22 [2022-11-26 01:16:51,455 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-26 01:16:51,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 39 [2022-11-26 01:16:51,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:16:51,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2022-11-26 01:16:52,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:16:52,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 28 [2022-11-26 01:16:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:16:52,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:17:02,168 INFO L321 Elim1Store]: treesize reduction 14, result has 65.9 percent of original size [2022-11-26 01:17:02,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 149 [2022-11-26 01:17:06,756 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse13 (= (bvadd (_ bv4 32) .cse4) (_ bv0 32)))) (let ((.cse5 (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (or (= c_~N~0 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (bvadd .cse17 (_ bv1 32) (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse17 (_ bv1 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= (select v_arrayElimArr_3 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) (_ bv1 32)))))) (.cse6 (not .cse13))) (and (or (and (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (or (= c_~N~0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select v_arrayElimArr_3 |ULTIMATE.start_main_~a~0#1.offset|))) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|)) .cse2 .cse3))))) (not (= (select v_arrayElimArr_3 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) (_ bv1 32))))) .cse5) .cse6) (forall ((v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32))) (or (= c_~N~0 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (bvadd .cse7 (_ bv1 32) (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse7 (_ bv1 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= (select v_arrayElimArr_3 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (not (= (select v_arrayElimArr_3 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) (_ bv1 32))))) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= c_~N~0 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (bvadd .cse10 (_ bv1 32) (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse10 (_ bv1 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= (select v_arrayElimArr_3 |ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (not (= (select v_arrayElimArr_3 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) (_ bv1 32))))) .cse13) (or .cse6 .cse5) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= c_~N~0 (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (bvadd .cse14 (_ bv1 32) (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse14 (_ bv1 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset|))))))) (not (= (select v_arrayElimArr_3 (bvadd (_ bv4 32) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) (_ bv1 32))))) .cse6))))) (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (bvslt (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) c_~N~0))) is different from false [2022-11-26 01:17:06,910 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 01:17:06,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 1 [2022-11-26 01:17:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 01:17:06,912 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:17:06,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394485607] [2022-11-26 01:17:06,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394485607] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:17:06,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2049000088] [2022-11-26 01:17:06,913 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:17:06,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:17:06,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:17:06,915 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:17:06,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-26 01:17:07,057 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:17:07,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:17:07,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-26 01:17:07,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:17:07,187 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-26 01:17:07,382 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:17:07,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-26 01:17:07,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:17:07,712 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-26 01:17:07,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-26 01:17:07,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-26 01:17:08,768 INFO L321 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2022-11-26 01:17:08,768 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 44 treesize of output 40 [2022-11-26 01:17:09,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:17:09,561 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:17:09,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-26 01:17:12,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:17:12,022 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:17:12,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 28 [2022-11-26 01:17:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:17:12,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:17:24,526 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 01:17:24,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 1 [2022-11-26 01:17:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:17:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2049000088] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:17:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341905975] [2022-11-26 01:17:24,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:17:24,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:17:24,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:17:24,532 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:17:24,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 01:17:24,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:17:24,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:17:24,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-26 01:17:24,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:17:24,656 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-26 01:17:24,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:17:24,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:17:24,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:17:25,805 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 44 treesize of output 27 [2022-11-26 01:17:26,543 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:17:26,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-11-26 01:17:33,042 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:17:33,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 28 [2022-11-26 01:17:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:17:33,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:17:39,396 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 01:17:39,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 1 [2022-11-26 01:17:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:17:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341905975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:17:39,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 01:17:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13, 12, 14, 12] total 55 [2022-11-26 01:17:39,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234120271] [2022-11-26 01:17:39,400 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 01:17:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-26 01:17:39,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:17:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-26 01:17:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2504, Unknown=21, NotChecked=104, Total=2970 [2022-11-26 01:17:39,403 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 55 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 55 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:17:54,590 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 60 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:18:00,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 01:18:02,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:18:08,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:18:33,076 WARN L233 SmtUtils]: Spent 22.28s on a formula simplification. DAG size of input: 158 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:18:35,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 01:18:39,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:18:49,451 WARN L233 SmtUtils]: Spent 8.83s on a formula simplification. DAG size of input: 63 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:19:10,542 WARN L233 SmtUtils]: Spent 18.99s on a formula simplification. DAG size of input: 154 DAG size of output: 121 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:19:32,652 WARN L233 SmtUtils]: Spent 19.25s on a formula simplification. DAG size of input: 156 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:19:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:19:32,842 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-11-26 01:19:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 01:19:32,844 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 55 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-26 01:19:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:19:32,845 INFO L225 Difference]: With dead ends: 50 [2022-11-26 01:19:32,845 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 01:19:32,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 136.5s TimeCoverageRelationStatistics Valid=757, Invalid=4926, Unknown=21, NotChecked=148, Total=5852 [2022-11-26 01:19:32,848 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 116 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 62 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-11-26 01:19:32,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 51 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 608 Invalid, 6 Unknown, 31 Unchecked, 15.4s Time] [2022-11-26 01:19:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 01:19:32,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-11-26 01:19:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:19:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-11-26 01:19:32,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 21 [2022-11-26 01:19:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:19:32,857 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-11-26 01:19:32,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 55 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:19:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-11-26 01:19:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 01:19:32,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:19:32,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:19:32,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:33,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:33,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:33,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:19:33,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:19:33,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:19:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1315040515, now seen corresponding path program 1 times [2022-11-26 01:19:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:19:33,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794720654] [2022-11-26 01:19:33,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:19:33,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:19:33,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:19:33,473 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:19:33,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-26 01:19:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:19:33,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-26 01:19:33,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:33,625 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 15 treesize of output 11 [2022-11-26 01:19:33,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-26 01:19:33,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 01:19:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:19:33,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:19:33,921 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 22 treesize of output 20 [2022-11-26 01:19:33,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-26 01:19:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:19:33,958 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:19:33,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794720654] [2022-11-26 01:19:33,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794720654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:19:33,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1383926826] [2022-11-26 01:19:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:19:33,959 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:19:33,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:19:33,963 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:19:33,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-26 01:19:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:19:34,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 01:19:34,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:34,187 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 15 treesize of output 11 [2022-11-26 01:19:34,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:19:34,294 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-26 01:19:34,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 01:19:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:19:34,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:19:34,502 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 22 treesize of output 20 [2022-11-26 01:19:34,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2022-11-26 01:19:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:19:34,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1383926826] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:19:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592496164] [2022-11-26 01:19:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:19:34,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:19:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:19:34,551 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:19:34,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-26 01:19:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:19:34,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-26 01:19:34,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:34,663 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 15 treesize of output 11 [2022-11-26 01:19:34,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:19:34,718 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-26 01:19:34,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 01:19:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:19:34,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:19:34,877 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 22 treesize of output 20 [2022-11-26 01:19:34,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2022-11-26 01:19:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 01:19:34,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592496164] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:19:34,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 01:19:34,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7, 8, 7, 8] total 15 [2022-11-26 01:19:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858477154] [2022-11-26 01:19:34,891 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 01:19:34,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-26 01:19:34,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:19:34,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-26 01:19:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-11-26 01:19:34,893 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:19:38,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:19:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:19:39,118 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-11-26 01:19:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 01:19:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-26 01:19:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:19:39,120 INFO L225 Difference]: With dead ends: 45 [2022-11-26 01:19:39,120 INFO L226 Difference]: Without dead ends: 28 [2022-11-26 01:19:39,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-11-26 01:19:39,121 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-26 01:19:39,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-26 01:19:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-26 01:19:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-11-26 01:19:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:19:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-11-26 01:19:39,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2022-11-26 01:19:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:19:39,135 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-11-26 01:19:39,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:19:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-11-26 01:19:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 01:19:39,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:19:39,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:19:39,145 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:39,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:39,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:39,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:19:39,737 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:19:39,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:19:39,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2022-11-26 01:19:39,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:19:39,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264255323] [2022-11-26 01:19:39,738 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-26 01:19:39,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:19:39,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:19:39,739 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:19:39,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-26 01:19:39,828 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-26 01:19:39,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:19:39,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 01:19:39,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:40,273 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-26 01:19:40,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:19:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:19:40,884 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:19:40,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264255323] [2022-11-26 01:19:40,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264255323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:19:40,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1460676576] [2022-11-26 01:19:40,885 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-26 01:19:40,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:19:40,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:19:40,886 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:19:40,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-26 01:19:41,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-26 01:19:41,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:19:41,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 01:19:41,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:41,648 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-26 01:19:41,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:19:42,566 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-26 01:19:42,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1460676576] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:19:42,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582952595] [2022-11-26 01:19:42,567 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-26 01:19:42,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:19:42,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:19:42,571 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:19:42,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-26 01:19:42,743 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-26 01:19:42,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:19:42,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-26 01:19:42,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:43,093 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-26 01:19:43,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:19:43,919 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-26 01:19:43,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582952595] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:19:43,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 01:19:43,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13, 12, 13, 12] total 47 [2022-11-26 01:19:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728594800] [2022-11-26 01:19:43,920 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 01:19:43,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-26 01:19:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:19:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-26 01:19:43,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2022-11-26 01:19:43,922 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:19:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:19:46,250 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-11-26 01:19:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 01:19:46,251 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-26 01:19:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:19:46,252 INFO L225 Difference]: With dead ends: 57 [2022-11-26 01:19:46,252 INFO L226 Difference]: Without dead ends: 50 [2022-11-26 01:19:46,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1001, Invalid=3031, Unknown=0, NotChecked=0, Total=4032 [2022-11-26 01:19:46,254 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 173 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:19:46,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 31 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 01:19:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-26 01:19:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-11-26 01:19:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 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-26 01:19:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-11-26 01:19:46,268 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 23 [2022-11-26 01:19:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:19:46,269 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-11-26 01:19:46,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:19:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-11-26 01:19:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 01:19:46,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:19:46,272 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:19:46,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:46,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:46,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-26 01:19:46,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 01:19:46,889 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 01:19:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:19:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2022-11-26 01:19:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 01:19:46,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389317130] [2022-11-26 01:19:46,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-26 01:19:46,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 01:19:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 01:19:46,891 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 01:19:46,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-26 01:19:47,035 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-26 01:19:47,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:19:47,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-26 01:19:47,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:47,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-26 01:19:47,157 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-26 01:19:47,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:19:47,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:19:47,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:19:47,478 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 44 treesize of output 27 [2022-11-26 01:19:47,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:19:47,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2022-11-26 01:19:48,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:19:48,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 57 [2022-11-26 01:19:48,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:19:48,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 31 [2022-11-26 01:19:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 01:19:48,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:19:55,396 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 01:19:55,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 365 treesize of output 1 [2022-11-26 01:19:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 5 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 01:19:55,400 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 01:19:55,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389317130] [2022-11-26 01:19:55,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389317130] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:19:55,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1925311064] [2022-11-26 01:19:55,401 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-26 01:19:55,401 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 01:19:55,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 01:19:55,403 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 01:19:55,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-26 01:19:55,566 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-26 01:19:55,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053139988] [2022-11-26 01:19:55,566 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-26 01:19:55,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:19:55,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:19:55,567 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:19:55,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 1 [2022-11-26 01:19:55,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1953dc8a-2c98-4acc-b99c-5c8aa4571e58/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-26 01:19:55,760 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-11-26 01:19:55,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:19:55,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-26 01:19:55,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:19:55,838 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-26 01:19:55,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-26 01:19:55,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:19:56,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:19:56,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-26 01:19:56,284 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 44 treesize of output 27 [2022-11-26 01:19:56,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:19:56,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 42 [2022-11-26 01:19:57,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:19:57,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 57 [2022-11-26 01:19:57,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:19:57,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 31 [2022-11-26 01:19:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 01:19:57,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:20:01,602 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 01:20:01,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 365 treesize of output 1 [2022-11-26 01:20:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 5 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 01:20:01,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053139988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:20:01,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 4 imperfect interpolant sequences. [2022-11-26 01:20:01,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 16] total 31 [2022-11-26 01:20:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77063828] [2022-11-26 01:20:01,606 INFO L85 oduleStraightlineAll]: Using 4 imperfect interpolants to construct interpolant automaton [2022-11-26 01:20:01,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-26 01:20:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 01:20:01,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-26 01:20:01,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=791, Unknown=2, NotChecked=0, Total=930 [2022-11-26 01:20:01,608 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 31 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 0 states have call successors, (0), 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-26 01:20:12,471 WARN L233 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:20:27,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-26 01:20:42,012 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 88 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:20:51,069 WARN L233 SmtUtils]: Spent 5.72s on a formula simplification. DAG size of input: 88 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:21:43,112 WARN L233 SmtUtils]: Spent 49.90s on a formula simplification. DAG size of input: 129 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:21:46,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:09,556 WARN L233 SmtUtils]: Spent 18.20s on a formula simplification. DAG size of input: 85 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:22:11,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:13,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:15,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:17,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:19,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:21,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:24,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:22:26,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:22:49,023 WARN L233 SmtUtils]: Spent 13.97s on a formula simplification. DAG size of input: 82 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:22:51,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:22:53,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:23:31,842 WARN L233 SmtUtils]: Spent 29.45s on a formula simplification. DAG size of input: 116 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:23:33,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:23:35,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:23:55,662 WARN L233 SmtUtils]: Spent 10.95s on a formula simplification. DAG size of input: 87 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:23:57,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:23:59,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 01:24:37,292 WARN L233 SmtUtils]: Spent 27.34s on a formula simplification. DAG size of input: 118 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:24:39,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:24:43,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 01:24:45,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]