./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/indp5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/indp5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b --- 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-5e519f3 [2022-11-02 20:27:48,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:27:48,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:27:48,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:27:48,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:27:48,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:27:48,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:27:48,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:27:48,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:27:48,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:27:48,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:27:48,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:27:48,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:27:48,780 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:27:48,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:27:48,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:27:48,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:27:48,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:27:48,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:27:48,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:27:48,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:27:48,807 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:27:48,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:27:48,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:27:48,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:27:48,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:27:48,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:27:48,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:27:48,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:27:48,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:27:48,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:27:48,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:27:48,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:27:48,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:27:48,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:27:48,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:27:48,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:27:48,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:27:48,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:27:48,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:27:48,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:27:48,843 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:27:48,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:27:48,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:27:48,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:27:48,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:27:48,897 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:27:48,897 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:27:48,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:27:48,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:27:48,899 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:27:48,899 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:27:48,900 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:27:48,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:27:48,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:27:48,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:27:48,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:27:48,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:27:48,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:27:48,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:27:48,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:27:48,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:27:48,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:27:48,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:27:48,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:27:48,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:27:48,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:48,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:27:48,905 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:27:48,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:27:48,905 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:27:48,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:27:48,906 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:27:48,906 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:27:48,907 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:27:48,907 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_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/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_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 -> 74cd32c72cd70d8592a00c1c607545b16193fd55a0cff14185e764bbc115500b [2022-11-02 20:27:49,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:27:49,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:27:49,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:27:49,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:27:49,334 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:27:49,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-fpi/indp5.c [2022-11-02 20:27:49,416 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/data/6fd4d4676/a563c8baf81c4cec832ee0eccd85f60c/FLAG5f955e7d7 [2022-11-02 20:27:50,029 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:27:50,029 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/sv-benchmarks/c/array-fpi/indp5.c [2022-11-02 20:27:50,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/data/6fd4d4676/a563c8baf81c4cec832ee0eccd85f60c/FLAG5f955e7d7 [2022-11-02 20:27:50,332 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/data/6fd4d4676/a563c8baf81c4cec832ee0eccd85f60c [2022-11-02 20:27:50,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:27:50,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:27:50,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:50,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:27:50,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:27:50,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64d2342a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50, skipping insertion in model container [2022-11-02 20:27:50,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:27:50,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:27:50,623 WARN L230 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_adc11301-0fa2-4069-a2d0-909cd3228e69/sv-benchmarks/c/array-fpi/indp5.c[588,601] [2022-11-02 20:27:50,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:50,659 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:27:50,675 WARN L230 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_adc11301-0fa2-4069-a2d0-909cd3228e69/sv-benchmarks/c/array-fpi/indp5.c[588,601] [2022-11-02 20:27:50,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:50,704 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:27:50,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50 WrapperNode [2022-11-02 20:27:50,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:50,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:50,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:27:50,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:27:50,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,751 INFO L138 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-11-02 20:27:50,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:50,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:27:50,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:27:50,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:27:50,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,784 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:27:50,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:27:50,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:27:50,790 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:27:50,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (1/1) ... [2022-11-02 20:27:50,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:50,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:27:50,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:27:50,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:27:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:27:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:27:50,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:27:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:27:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:27:50,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:27:50,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:27:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:27:50,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:27:50,982 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:27:50,985 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:27:51,202 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:27:51,210 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:27:51,211 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:27:51,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:51 BoogieIcfgContainer [2022-11-02 20:27:51,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:27:51,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:27:51,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:27:51,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:27:51,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:27:50" (1/3) ... [2022-11-02 20:27:51,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1613cb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:51, skipping insertion in model container [2022-11-02 20:27:51,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:50" (2/3) ... [2022-11-02 20:27:51,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1613cb1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:51, skipping insertion in model container [2022-11-02 20:27:51,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:51" (3/3) ... [2022-11-02 20:27:51,226 INFO L112 eAbstractionObserver]: Analyzing ICFG indp5.c [2022-11-02 20:27:51,252 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:27:51,252 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:27:51,324 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:27:51,332 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22104c33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:27:51,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:27:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:27:51,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:51,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:51,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash 118053350, now seen corresponding path program 1 times [2022-11-02 20:27:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:51,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055218645] [2022-11-02 20:27:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:51,569 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-02 20:27:51,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:51,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055218645] [2022-11-02 20:27:51,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055218645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:51,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:51,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932130070] [2022-11-02 20:27:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:51,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:27:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:51,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:27:51,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:27:51,621 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-02 20:27:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:51,641 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-11-02 20:27:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:27:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:27:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:51,665 INFO L225 Difference]: With dead ends: 50 [2022-11-02 20:27:51,666 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 20:27:51,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-02 20:27:51,677 INFO L413 NwaCegarLoop]: 32 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, 32 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-02 20:27:51,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:27:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 20:27:51,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 20:27:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-02 20:27:51,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2022-11-02 20:27:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:51,720 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-02 20:27:51,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-02 20:27:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-02 20:27:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:27:51,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:51,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:51,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:27:51,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:51,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1065017552, now seen corresponding path program 1 times [2022-11-02 20:27:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:51,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104183318] [2022-11-02 20:27:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:51,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:51,973 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-02 20:27:51,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:51,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104183318] [2022-11-02 20:27:51,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104183318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:51,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:51,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:27:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421035184] [2022-11-02 20:27:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:51,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:27:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:52,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:27:52,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:52,014 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02 20:27:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:27:52,213 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-11-02 20:27:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:27:52,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:27:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:27:52,215 INFO L225 Difference]: With dead ends: 49 [2022-11-02 20:27:52,215 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 20:27:52,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:27:52,217 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:27:52,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 13 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:27:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 20:27:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-11-02 20:27:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:27:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-11-02 20:27:52,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2022-11-02 20:27:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:27:52,240 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-11-02 20:27:52,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02 20:27:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-11-02 20:27:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:27:52,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:27:52,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:52,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:27:52,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:27:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:52,251 INFO L85 PathProgramCache]: Analyzing trace with hash 524088314, now seen corresponding path program 1 times [2022-11-02 20:27:52,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:52,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385543383] [2022-11-02 20:27:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:52,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:27:52,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33843398] [2022-11-02 20:27:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:52,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:27:52,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:27:52,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:27:52,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:27:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:52,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:27:52,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:27:52,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:27:52,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:27:52,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 69 [2022-11-02 20:27:52,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:27:52,768 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:27:53,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 21 [2022-11-02 20:27:53,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 21 [2022-11-02 20:27:53,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 21 [2022-11-02 20:27:53,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:27:53,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:27:53,561 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-02 20:27:53,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:07,673 WARN L234 SmtUtils]: Spent 9.39s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:28:07,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:28:07,711 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-02 20:28:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:07,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385543383] [2022-11-02 20:28:07,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:28:07,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33843398] [2022-11-02 20:28:07,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33843398] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:28:07,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:28:07,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2022-11-02 20:28:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765803709] [2022-11-02 20:28:07,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:28:07,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:28:07,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:28:07,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=239, Unknown=2, NotChecked=0, Total=306 [2022-11-02 20:28:07,717 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 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-02 20:28:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:13,526 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2022-11-02 20:28:13,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:28:13,527 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 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 27 [2022-11-02 20:28:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:13,530 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:28:13,531 INFO L226 Difference]: Without dead ends: 75 [2022-11-02 20:28:13,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=148, Invalid=500, Unknown=2, NotChecked=0, Total=650 [2022-11-02 20:28:13,533 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:13,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 56 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 248 Invalid, 0 Unknown, 48 Unchecked, 2.2s Time] [2022-11-02 20:28:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-02 20:28:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2022-11-02 20:28:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-11-02 20:28:13,559 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 27 [2022-11-02 20:28:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:13,560 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-11-02 20:28:13,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 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-02 20:28:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-11-02 20:28:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:28:13,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:13,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:13,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:13,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:13,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1190930620, now seen corresponding path program 2 times [2022-11-02 20:28:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:13,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894315549] [2022-11-02 20:28:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:13,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:28:13,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34100392] [2022-11-02 20:28:13,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:28:13,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:13,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:13,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:13,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:28:13,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:28:13,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:28:13,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:28:13,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:28:14,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:28:14,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:14,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894315549] [2022-11-02 20:28:14,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:28:14,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34100392] [2022-11-02 20:28:14,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34100392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:28:14,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:28:14,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-02 20:28:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409864943] [2022-11-02 20:28:14,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:28:14,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:28:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:14,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:28:14,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:28:14,080 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:14,365 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2022-11-02 20:28:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:28:14,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:28:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:14,367 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:28:14,367 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:28:14,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:28:14,369 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:14,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 33 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:28:14,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:28:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2022-11-02 20:28:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-02 20:28:14,393 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 29 [2022-11-02 20:28:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:14,394 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-02 20:28:14,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-02 20:28:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:28:14,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:14,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:14,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:14,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:14,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash 264308668, now seen corresponding path program 3 times [2022-11-02 20:28:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655628585] [2022-11-02 20:28:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:14,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:28:14,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485129001] [2022-11-02 20:28:14,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:28:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:14,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:14,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:28:14,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:28:14,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:28:14,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:28:14,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:28:14,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:28:14,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655628585] [2022-11-02 20:28:14,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:28:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485129001] [2022-11-02 20:28:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485129001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:28:14,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:28:14,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-02 20:28:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040494752] [2022-11-02 20:28:14,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:28:14,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:28:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:28:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:28:14,986 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:15,232 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-11-02 20:28:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:28:15,233 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:28:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:15,234 INFO L225 Difference]: With dead ends: 58 [2022-11-02 20:28:15,234 INFO L226 Difference]: Without dead ends: 42 [2022-11-02 20:28:15,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:28:15,236 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:15,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 18 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:28:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-02 20:28:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-11-02 20:28:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 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-02 20:28:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-02 20:28:15,244 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 29 [2022-11-02 20:28:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:15,244 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-02 20:28:15,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:28:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-02 20:28:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:28:15,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:15,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:15,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:28:15,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:15,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash 982389828, now seen corresponding path program 4 times [2022-11-02 20:28:15,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:15,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021268651] [2022-11-02 20:28:15,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:15,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:15,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:28:15,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516756965] [2022-11-02 20:28:15,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:28:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:15,475 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:15,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_adc11301-0fa2-4069-a2d0-909cd3228e69/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:28:15,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:28:15,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:28:15,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-02 20:28:15,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:15,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:28:15,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:28:15,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 71 treesize of output 69 [2022-11-02 20:28:15,876 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:28:15,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:28:15,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-11-02 20:28:16,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 112 [2022-11-02 20:28:16,150 INFO L356 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2022-11-02 20:28:16,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 101 treesize of output 156 [2022-11-02 20:28:16,189 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:28:16,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:16,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 35 [2022-11-02 20:28:16,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 108 [2022-11-02 20:28:16,553 INFO L356 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2022-11-02 20:28:16,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 152 [2022-11-02 20:28:16,634 INFO L356 Elim1Store]: treesize reduction 98, result has 11.7 percent of original size [2022-11-02 20:28:16,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 102 treesize of output 37 [2022-11-02 20:28:16,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:16,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 35 [2022-11-02 20:28:16,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 118 treesize of output 108 [2022-11-02 20:28:16,927 INFO L356 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2022-11-02 20:28:16,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 97 treesize of output 152 [2022-11-02 20:28:16,940 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:28:17,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:17,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 35 [2022-11-02 20:28:17,269 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-02 20:28:17,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 84 [2022-11-02 20:28:17,412 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-02 20:28:17,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 84 [2022-11-02 20:28:17,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:28:17,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 56 treesize of output 28 [2022-11-02 20:28:17,825 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-02 20:28:17,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:28:40,094 WARN L234 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:29:40,244 WARN L234 SmtUtils]: Spent 22.55s on a formula simplification that was a NOOP. DAG size: 133 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:29:53,517 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse37 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse38 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse36 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (* .cse36 8)) (.cse11 (+ .cse38 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) 1)) (.cse12 (* (mod .cse37 4294967296) 8)) (.cse13 (+ (* .cse37 .cse37) .cse38 3)) (.cse14 (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (<= .cse36 2147483647))) (and (or .cse0 (and (or .cse1 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (< (let ((.cse7 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse13))) (let ((.cse3 (select .cse7 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (select .cse7 .cse6))) (store (store (store (store (store (store .cse7 |ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse6 (+ (- 1) .cse8)) |ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse6 (+ .cse8 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse6 (+ .cse8 (- 3))))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse2 .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))))))) .cse14))) (or .cse1 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (< 1 (let ((.cse20 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10 (- 34359738368)) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse13))) (let ((.cse16 (select .cse20 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse21 (select .cse20 .cse19))) (store (store (store (store (store (store .cse20 |ULTIMATE.start_main_~a~0#1.offset| .cse16) .cse19 (+ (- 1) .cse21)) |ULTIMATE.start_main_~a~0#1.offset| .cse16) .cse19 (+ .cse21 (- 2))) |ULTIMATE.start_main_~a~0#1.offset| .cse16) .cse19 (+ .cse21 (- 3))))))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse15 .cse16 (select (select (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse19)))))))))))) (or (and (or .cse1 (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (< 1 (let ((.cse27 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse13))) (let ((.cse25 (select .cse27 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse28 (select .cse27 .cse26))) (store (store (store (store (store (store .cse27 |ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse26 (+ (- 1) .cse28)) |ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse26 (+ (- 2) .cse28)) |ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse26 (+ (- 3) .cse28)))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse26) .cse25))))))))) (or (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int)) (< (let ((.cse34 (store (store .cse9 (+ |ULTIMATE.start_main_~a~0#1.offset| .cse10) .cse11) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse12) .cse13))) (let ((.cse32 (select .cse34 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse33 (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (select .cse34 .cse33))) (store (store (store (store (store (store .cse34 |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33 (+ (- 1) .cse35)) |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33 (+ (- 2) .cse35)) |ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse33 (+ (- 3) .cse35)))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse33) .cse32)))))) .cse14)) .cse1)) (not .cse0))))) is different from true [2022-11-02 20:29:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:29:53,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:53,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021268651] [2022-11-02 20:29:53,535 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:29:53,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516756965] [2022-11-02 20:29:53,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516756965] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:29:53,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:29:53,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 44 [2022-11-02 20:29:53,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965957039] [2022-11-02 20:29:53,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:53,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:29:53,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:53,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:29:53,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1616, Unknown=4, NotChecked=82, Total=1892 [2022-11-02 20:29:53,539 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 44 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 44 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:29:56,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:30:04,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:30:08,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse66 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse65 (* .cse66 8))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (<= .cse66 2147483647)) (.cse63 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse54 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse13 (let ((.cse64 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse54 .cse64 (+ .cse63 (select .cse54 .cse64))))) (.cse0 (not .cse8)) (.cse6 (store .cse54 .cse62 (+ .cse63 (select .cse54 .cse62)))) (.cse15 (< 2 c_~N~0)) (.cse17 (let ((.cse60 (store .cse54 .cse62 (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) 1)))) (let ((.cse56 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse61 (select .cse60 .cse5))) (store (store (store (store (store (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| .cse56) .cse5 (+ (- 1) .cse61)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse56) .cse5 (+ .cse61 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse56) .cse5 (+ .cse61 (- 3))))))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse56 .cse57 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (.cse16 (< 1 |c_ULTIMATE.start_main_~i~0#1|))) (and (or (and (or .cse0 (= c_~N~0 (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse6 .cse5))) (store (store (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 1) .cse7)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 2) .cse7)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4))))))) (or .cse8 (= c_~N~0 (let ((.cse9 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (select .cse13 .cse5))) (store (store (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) .cse5 (+ (- 1) .cse14)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) .cse5 (+ (- 2) .cse14)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))))) .cse15) (or .cse16 (< .cse17 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (or .cse15 (let ((.cse47 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse49 (mod .cse47 4294967296))) (let ((.cse27 (<= .cse49 2147483647)) (.cse48 (* .cse49 8))) (let ((.cse34 (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse25 (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (* (- 1) .cse47 .cse47)) (.cse18 (not .cse27))) (and (or (and (or .cse18 (= c_~N~0 (let ((.cse23 (store .cse13 .cse25 (+ .cse26 (select .cse13 .cse25))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (select .cse23 .cse5))) (store (store (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ (- 1) .cse24)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ (- 2) .cse24)))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse22)))))))) (or .cse27 (= c_~N~0 (let ((.cse32 (store .cse13 .cse34 (+ .cse26 (select .cse13 .cse34))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (select .cse32 .cse5))) (store (store (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 1) .cse33)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 2) .cse33)))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse30 .cse31))))))))) .cse8) (or .cse0 (and (or .cse27 (= c_~N~0 (let ((.cse39 (store .cse6 .cse34 (+ (select .cse6 .cse34) .cse26)))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (select .cse39 .cse5))) (store (store (store (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse5 (+ (- 1) .cse40)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse5 (+ .cse40 (- 2))))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse37 .cse38)))))))) (or (= c_~N~0 (let ((.cse45 (store .cse6 .cse25 (+ (select .cse6 .cse25) .cse26)))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse46 (select .cse45 .cse5))) (store (store (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse5 (+ .cse46 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse5 (+ .cse46 (- 2))))))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse43 .cse44))))))) .cse18))))))))) (or (= c_~N~0 (let ((.cse53 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (select .cse54 .cse5))) (store (store (store (store (store (store .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse5 (+ (- 1) .cse55)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse5 (+ .cse55 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse5 (+ .cse55 (- 3))))))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse52 .cse53)))))) .cse15) (or (< 1 .cse17) .cse16)))))) is different from false [2022-11-02 20:30:10,265 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse66 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse65 (* .cse66 8))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse62 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (<= .cse66 2147483647)) (.cse63 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse54 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse13 (let ((.cse64 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse54 .cse64 (+ .cse63 (select .cse54 .cse64))))) (.cse0 (not .cse8)) (.cse6 (store .cse54 .cse62 (+ .cse63 (select .cse54 .cse62)))) (.cse15 (< 2 c_~N~0)) (.cse17 (let ((.cse60 (store .cse54 .cse62 (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) 1)))) (let ((.cse56 (select .cse60 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse61 (select .cse60 .cse5))) (store (store (store (store (store (store .cse60 |c_ULTIMATE.start_main_~a~0#1.offset| .cse56) .cse5 (+ (- 1) .cse61)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse56) .cse5 (+ .cse61 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse56) .cse5 (+ .cse61 (- 3))))))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse56 .cse57 (select (select (store .cse58 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (.cse16 (< 1 |c_ULTIMATE.start_main_~i~0#1|))) (and (or (and (or .cse0 (= c_~N~0 (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse6 .cse5))) (store (store (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 1) .cse7)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 2) .cse7)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4))))))) (or .cse8 (= c_~N~0 (let ((.cse9 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (select .cse13 .cse5))) (store (store (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) .cse5 (+ (- 1) .cse14)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) .cse5 (+ (- 2) .cse14)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))))) .cse15) (or .cse16 (< .cse17 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (or .cse15 (let ((.cse47 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse49 (mod .cse47 4294967296))) (let ((.cse27 (<= .cse49 2147483647)) (.cse48 (* .cse49 8))) (let ((.cse34 (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse25 (+ .cse48 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (* (- 1) .cse47 .cse47)) (.cse18 (not .cse27))) (and (or (and (or .cse18 (= c_~N~0 (let ((.cse23 (store .cse13 .cse25 (+ .cse26 (select .cse13 .cse25))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (select .cse23 .cse5))) (store (store (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ (- 1) .cse24)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ (- 2) .cse24)))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse22)))))))) (or .cse27 (= c_~N~0 (let ((.cse32 (store .cse13 .cse34 (+ .cse26 (select .cse13 .cse34))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (select .cse32 .cse5))) (store (store (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 1) .cse33)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 2) .cse33)))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse30 .cse31))))))))) .cse8) (or .cse0 (and (or .cse27 (= c_~N~0 (let ((.cse39 (store .cse6 .cse34 (+ (select .cse6 .cse34) .cse26)))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (select .cse39 .cse5))) (store (store (store (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse5 (+ (- 1) .cse40)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse5 (+ .cse40 (- 2))))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse37 .cse38)))))))) (or (= c_~N~0 (let ((.cse45 (store .cse6 .cse25 (+ (select .cse6 .cse25) .cse26)))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse46 (select .cse45 .cse5))) (store (store (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse5 (+ .cse46 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse5 (+ .cse46 (- 2))))))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse43 .cse44))))))) .cse18))))))))) (or (= c_~N~0 (let ((.cse53 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse55 (select .cse54 .cse5))) (store (store (store (store (store (store .cse54 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse5 (+ (- 1) .cse55)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse5 (+ .cse55 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse53) .cse5 (+ .cse55 (- 3))))))) (let ((.cse51 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse52 .cse53)))))) .cse15) (or (< 1 .cse17) .cse16)))))) is different from true [2022-11-02 20:30:36,512 WARN L234 SmtUtils]: Spent 11.87s on a formula simplification. DAG size of input: 125 DAG size of output: 96 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:30:40,436 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse57 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse59 (mod .cse57 4294967296))) (let ((.cse12 (<= .cse59 2147483647)) (.cse58 (* .cse59 8))) (let ((.cse0 (< 2 c_~N~0)) (.cse19 (+ .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse1 (not .cse12)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse20 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (* (- 1) .cse57 .cse57))) (and (or .cse0 (let ((.cse39 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse24 (<= .cse39 2147483647)) (.cse22 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse23 (* .cse39 8))) (and (or (let ((.cse9 (let ((.cse21 (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse20 .cse21 (+ .cse22 (select .cse20 .cse21)))))) (and (or .cse1 (= c_~N~0 (let ((.cse7 (store .cse9 .cse10 (+ .cse11 (select .cse9 .cse10))))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (select .cse7 .cse6))) (store (store (store (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) .cse6 (+ (- 1) .cse8)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) .cse6 (+ (- 2) .cse8)))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse5)))))))) (or .cse12 (= c_~N~0 (let ((.cse17 (store .cse9 .cse19 (+ .cse11 (select .cse9 .cse19))))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (select .cse17 .cse6))) (store (store (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| .cse16) .cse6 (+ (- 1) .cse18)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse16) .cse6 (+ (- 2) .cse18)))))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse16))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse15 .cse16)))))))))) .cse24) (or (not .cse24) (let ((.cse31 (let ((.cse38 (+ .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse20 .cse38 (+ .cse22 (select .cse20 .cse38)))))) (and (or .cse12 (= c_~N~0 (let ((.cse29 (store .cse31 .cse19 (+ (select .cse31 .cse19) .cse11)))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse30 (select .cse29 .cse6))) (store (store (store (store .cse29 |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) .cse6 (+ (- 1) .cse30)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) .cse6 (+ .cse30 (- 2))))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse27 .cse28)))))))) (or (= c_~N~0 (let ((.cse36 (store .cse31 .cse10 (+ (select .cse31 .cse10) .cse11)))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse37 (select .cse36 .cse6))) (store (store (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35) .cse6 (+ .cse37 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse35) .cse6 (+ .cse37 (- 2))))))) (let ((.cse33 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse34 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse34 .cse35))))))) .cse1)))))))) (or (= c_~N~0 (let ((.cse43 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse44 (select .cse20 .cse6))) (store (store (store (store (store (store .cse20 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) .cse6 (+ (- 1) .cse44)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) .cse6 (+ .cse44 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) .cse6 (+ .cse44 (- 3))))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse42 .cse43)))))) .cse0) (or .cse0 (and (or .cse12 (= c_~N~0 (let ((.cse49 (store .cse20 .cse19 (+ .cse11 (select .cse20 .cse19))))) (let ((.cse47 (select .cse49 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse50 (select .cse49 .cse6))) (store (store (store (store .cse49 |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse6 (+ (- 1) .cse50)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse47) .cse6 (+ .cse50 (- 2))))))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse48 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse47 .cse48)))))))) (or .cse1 (= (let ((.cse55 (store .cse20 .cse10 (+ (select .cse20 .cse10) .cse11)))) (let ((.cse51 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse56 (select .cse55 .cse6))) (store (store (store (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse6 (+ (- 1) .cse56)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) .cse6 (+ (- 2) .cse56)))))) (let ((.cse53 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse51 (select (select (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse51 .cse54))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6) .cse54)))))) c_~N~0))))))))) is different from true [2022-11-02 20:30:44,307 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse60 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse72 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse71 (* .cse72 8)) (.cse73 (mod .cse60 4294967296))) (let ((.cse27 (<= .cse73 2147483647)) (.cse61 (* .cse73 8)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse68 (+ .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (<= .cse72 2147483647)) (.cse69 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (.cse47 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse13 (let ((.cse70 (+ .cse71 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse47 .cse70 (+ .cse69 (select .cse47 .cse70))))) (.cse0 (not .cse8)) (.cse6 (store .cse47 .cse68 (+ .cse69 (select .cse47 .cse68)))) (.cse17 (let ((.cse66 (store .cse47 .cse68 (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) 1)))) (let ((.cse62 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse67 (select .cse66 .cse5))) (store (store (store (store (store (store .cse66 |c_ULTIMATE.start_main_~a~0#1.offset| .cse62) .cse5 (+ (- 1) .cse67)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse62) .cse5 (+ .cse67 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse62) .cse5 (+ .cse67 (- 3))))))) (let ((.cse65 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse62 .cse63 (select (select (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse65 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse62 .cse63))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)))))))) (.cse16 (< 1 |c_ULTIMATE.start_main_~i~0#1|)) (.cse15 (< 2 c_~N~0)) (.cse34 (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse18 (not .cse27)) (.cse25 (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (* (- 1) .cse60 .cse60))) (and (or (and (or .cse0 (= c_~N~0 (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse6 .cse5))) (store (store (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 1) .cse7)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 2) .cse7)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4))))))) (or .cse8 (= c_~N~0 (let ((.cse9 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (select .cse13 .cse5))) (store (store (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) .cse5 (+ (- 1) .cse14)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse9) .cse5 (+ (- 2) .cse14)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse9 .cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))))) .cse15) (or .cse16 (< .cse17 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (or .cse15 (and (or (and (or .cse18 (= c_~N~0 (let ((.cse23 (store .cse13 .cse25 (+ .cse26 (select .cse13 .cse25))))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (select .cse23 .cse5))) (store (store (store (store .cse23 |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ (- 1) .cse24)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) .cse5 (+ (- 2) .cse24)))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse22)))))))) (or .cse27 (= c_~N~0 (let ((.cse32 (store .cse13 .cse34 (+ .cse26 (select .cse13 .cse34))))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (select .cse32 .cse5))) (store (store (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 1) .cse33)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 2) .cse33)))))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse30 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse30 .cse31))))))))) .cse8) (or .cse0 (and (or .cse27 (= c_~N~0 (let ((.cse39 (store .cse6 .cse34 (+ (select .cse6 .cse34) .cse26)))) (let ((.cse38 (select .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (select .cse39 .cse5))) (store (store (store (store .cse39 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse5 (+ (- 1) .cse40)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse5 (+ .cse40 (- 2))))))) (let ((.cse36 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse37 .cse38)))))))) (or (= c_~N~0 (let ((.cse45 (store .cse6 .cse25 (+ (select .cse6 .cse25) .cse26)))) (let ((.cse44 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse46 (select .cse45 .cse5))) (store (store (store (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse5 (+ .cse46 (- 1))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse44) .cse5 (+ .cse46 (- 2))))))) (let ((.cse42 (select .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse44))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse43 .cse44))))))) .cse18))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (< 1 c_~N~0) (= (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or (< 1 .cse17) .cse16) (or .cse15 (and (or .cse27 (= c_~N~0 (let ((.cse52 (store .cse47 .cse34 (+ .cse26 (select .cse47 .cse34))))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse53 (select .cse52 .cse5))) (store (store (store (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| .cse50) .cse5 (+ (- 1) .cse53)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse50) .cse5 (+ .cse53 (- 2))))))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse51 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse50 .cse51))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse50 .cse51)))))))) (or .cse18 (= (let ((.cse58 (store .cse47 .cse25 (+ (select .cse47 .cse25) .cse26)))) (let ((.cse54 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse55 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse59 (select .cse58 .cse5))) (store (store (store (store .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse5 (+ (- 1) .cse59)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse54) .cse5 (+ (- 2) .cse59)))))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse57 (select .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse54 (select (select (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse56 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse54 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse57)))))) c_~N~0)))) (= (select .cse47 .cse5) 3)))))) is different from true [2022-11-02 20:30:47,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:19,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:25,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:28,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:32,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:34,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:39,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse66 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse65 (* .cse66 8)) (.cse67 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse27 (<= .cse67 2147483647)) (.cse64 (* .cse67 8)) (.cse19 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse12 (<= .cse66 2147483647)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select .cse8 .cse9)) (.cse0 (not .cse12)) (.cse20 (select .cse8 .cse19)) (.cse34 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse36 (not .cse27)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse21 (< 2 c_~N~0))) (and (or (let ((.cse10 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (and (or .cse0 (= c_~N~0 (let ((.cse6 (store .cse8 .cse9 (+ .cse10 .cse11)))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse6 .cse5))) (store (store (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 1) .cse7)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 2) .cse7)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4)))))))) (or .cse12 (= c_~N~0 (let ((.cse17 (store .cse8 .cse19 (+ .cse10 .cse20)))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (select .cse17 .cse5))) (store (store (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse5 (+ (- 1) .cse18)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse5 (+ (- 2) .cse18)))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))))))) .cse21) (or (= c_~N~0 (let ((.cse25 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse26 (select .cse8 .cse5))) (store (store (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse5 (+ (- 1) .cse26)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse5 (+ .cse26 (- 2))))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse25)))))) .cse21) (or .cse21 (and (or (let ((.cse33 (store .cse8 .cse9 (+ .cse35 .cse11)))) (and (or .cse27 (= c_~N~0 (let ((.cse32 (store .cse33 .cse34 (+ (- 1) (select .cse33 .cse34) .cse35)))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 1) (select .cse32 .cse5)))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse31)))))))) (or .cse36 (= c_~N~0 (let ((.cse41 (store .cse33 .cse42 (+ (- 1) .cse35 (select .cse33 .cse42))))) (let ((.cse39 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse39) .cse5 (+ (- 1) (select .cse41 .cse5)))))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse39 .cse40)))))))))) .cse0) (or .cse12 (let ((.cse48 (store .cse8 .cse19 (+ .cse35 .cse20)))) (and (or .cse27 (= c_~N~0 (let ((.cse47 (store .cse48 .cse34 (+ (- 1) (select .cse48 .cse34) .cse35)))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) .cse5 (+ (- 1) (select .cse47 .cse5)))))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse46)))))))) (or (= (let ((.cse53 (store .cse48 .cse42 (+ (- 1) .cse35 (select .cse48 .cse42))))) (let ((.cse50 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| .cse50) .cse5 (+ (- 1) (select .cse53 .cse5)))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse49 .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) c_~N~0) .cse36)))))) (or (and (or .cse27 (= (let ((.cse58 (store .cse8 .cse34 (+ (- 1) .cse35 (select .cse8 .cse34))))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| .cse57) .cse5 (+ (- 1) (select .cse58 .cse5)))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse56 .cse57)))))) c_~N~0)) (or .cse36 (= c_~N~0 (let ((.cse63 (store .cse8 .cse42 (+ (- 1) (select .cse8 .cse42) .cse35)))) (let ((.cse61 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61) .cse5 (+ (- 1) (select .cse63 .cse5)))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse61 .cse62))))))))) .cse21)))))) is different from false [2022-11-02 20:31:41,214 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse66 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse65 (* .cse66 8)) (.cse67 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse27 (<= .cse67 2147483647)) (.cse64 (* .cse67 8)) (.cse19 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse12 (<= .cse66 2147483647)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select .cse8 .cse9)) (.cse0 (not .cse12)) (.cse20 (select .cse8 .cse19)) (.cse34 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse36 (not .cse27)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse42 (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse21 (< 2 c_~N~0))) (and (or (let ((.cse10 (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (and (or .cse0 (= c_~N~0 (let ((.cse6 (store .cse8 .cse9 (+ .cse10 .cse11)))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (select .cse6 .cse5))) (store (store (store (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 1) .cse7)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse3) .cse5 (+ (- 2) .cse7)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse3 .cse4)))))))) (or .cse12 (= c_~N~0 (let ((.cse17 (store .cse8 .cse19 (+ .cse10 .cse20)))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (select .cse17 .cse5))) (store (store (store (store .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse5 (+ (- 1) .cse18)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse5 (+ (- 2) .cse18)))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))))))) .cse21) (or (= c_~N~0 (let ((.cse25 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse26 (select .cse8 .cse5))) (store (store (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse5 (+ (- 1) .cse26)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse5 (+ .cse26 (- 2))))))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse22 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse25)))))) .cse21) (or .cse21 (and (or (let ((.cse33 (store .cse8 .cse9 (+ .cse35 .cse11)))) (and (or .cse27 (= c_~N~0 (let ((.cse32 (store .cse33 .cse34 (+ (- 1) (select .cse33 .cse34) .cse35)))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse32 |c_ULTIMATE.start_main_~a~0#1.offset| .cse31) .cse5 (+ (- 1) (select .cse32 .cse5)))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse31))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse31)))))))) (or .cse36 (= c_~N~0 (let ((.cse41 (store .cse33 .cse42 (+ (- 1) .cse35 (select .cse33 .cse42))))) (let ((.cse39 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse39) .cse5 (+ (- 1) (select .cse41 .cse5)))))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse40 (select .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse38 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse40))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse39 .cse40)))))))))) .cse0) (or .cse12 (let ((.cse48 (store .cse8 .cse19 (+ .cse35 .cse20)))) (and (or .cse27 (= c_~N~0 (let ((.cse47 (store .cse48 .cse34 (+ (- 1) (select .cse48 .cse34) .cse35)))) (let ((.cse43 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) .cse5 (+ (- 1) (select .cse47 .cse5)))))) (let ((.cse45 (select .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse46 (select .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse45 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse43 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse46)))))))) (or (= (let ((.cse53 (store .cse48 .cse42 (+ (- 1) .cse35 (select .cse48 .cse42))))) (let ((.cse50 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse53 |c_ULTIMATE.start_main_~a~0#1.offset| .cse50) .cse5 (+ (- 1) (select .cse53 .cse5)))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse49 .cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))))))) c_~N~0) .cse36)))))) (or (and (or .cse27 (= (let ((.cse58 (store .cse8 .cse34 (+ (- 1) .cse35 (select .cse8 .cse34))))) (let ((.cse57 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse58 |c_ULTIMATE.start_main_~a~0#1.offset| .cse57) .cse5 (+ (- 1) (select .cse58 .cse5)))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse56 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse56 .cse57))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse56 .cse57)))))) c_~N~0)) (or .cse36 (= c_~N~0 (let ((.cse63 (store .cse8 .cse42 (+ (- 1) (select .cse8 .cse42) .cse35)))) (let ((.cse61 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61) .cse5 (+ (- 1) (select .cse63 .cse5)))))) (let ((.cse60 (select .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse62 (select .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse59 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse60 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse61 .cse62))))))))) .cse21)))))) is different from true [2022-11-02 20:31:43,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:46,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:49,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:50,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:52,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:31:55,260 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse62 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296))) (let ((.cse61 (* .cse62 8)) (.cse63 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse17 (<= .cse63 2147483647)) (.cse59 (* .cse63 8)) (.cse10 (<= .cse62 2147483647)) (.cse24 (* (- 1) |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse58 (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse9 (store .cse0 .cse58 (+ .cse24 (select .cse0 .cse58)))) (.cse4 (not .cse10)) (.cse15 (let ((.cse60 (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)))) (store .cse0 .cse60 (+ .cse24 (select .cse0 .cse60))))) (.cse23 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368))) (.cse25 (not .cse17)) (.cse31 (+ .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse16 (< 2 c_~N~0)) (.cse3 (let ((.cse56 (store .cse0 .cse58 (+ (* 2 |c_ULTIMATE.start_main_~i~0#1|) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) 1)))) (let ((.cse52 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse57 (select .cse56 .cse1))) (store (store (store (store (store (store .cse56 |c_ULTIMATE.start_main_~a~0#1.offset| .cse52) .cse1 (+ (- 1) .cse57)) |c_ULTIMATE.start_main_~a~0#1.offset| .cse52) .cse1 (+ .cse57 (- 2))) |c_ULTIMATE.start_main_~a~0#1.offset| .cse52) .cse1 (+ .cse57 (- 3))))))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse53 (select .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse52 .cse53 (select (select (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse55 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse52 .cse53))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))))) (.cse2 (< 1 |c_ULTIMATE.start_main_~i~0#1|))) (and (= (select .cse0 .cse1) 2) (or .cse2 (< .cse3 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (or (and (or .cse4 (= c_~N~0 (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) .cse1 (+ (- 1) (select .cse9 .cse1)))))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse5 .cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))))) (or .cse10 (= c_~N~0 (let ((.cse13 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) .cse1 (+ (- 1) (select .cse15 .cse1)))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse13 .cse14)))))))) .cse16) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse16 (and (or (and (or .cse17 (= c_~N~0 (let ((.cse22 (store .cse9 .cse23 (+ (- 1) (select .cse9 .cse23) .cse24)))) (let ((.cse21 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| .cse21) .cse1 (+ (- 1) (select .cse22 .cse1)))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse18 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse21)))))))) (or .cse25 (= c_~N~0 (let ((.cse30 (store .cse9 .cse31 (+ (- 1) .cse24 (select .cse9 .cse31))))) (let ((.cse28 (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse28) .cse1 (+ (- 1) (select .cse30 .cse1)))))) (let ((.cse27 (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse28 .cse29))))))))) .cse4) (or .cse10 (and (or .cse17 (= c_~N~0 (let ((.cse36 (store .cse15 .cse23 (+ (- 1) (select .cse15 .cse23) .cse24)))) (let ((.cse32 (select .cse36 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse36 |c_ULTIMATE.start_main_~a~0#1.offset| .cse32) .cse1 (+ (- 1) (select .cse36 .cse1)))))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse35))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse35)))))))) (or (= (let ((.cse41 (store .cse15 .cse31 (+ (- 1) .cse24 (select .cse15 .cse31))))) (let ((.cse38 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse41 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38) .cse1 (+ (- 1) (select .cse41 .cse1)))))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse37 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse37 .cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))))) c_~N~0) .cse25))))) (or (and (or .cse17 (= (let ((.cse46 (store .cse0 .cse23 (+ (- 1) .cse24 (select .cse0 .cse23))))) (let ((.cse45 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse45) .cse1 (+ (- 1) (select .cse46 .cse1)))))) (let ((.cse43 (select .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse42 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse44 .cse45))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse44 .cse45)))))) c_~N~0)) (or .cse25 (= c_~N~0 (let ((.cse51 (store .cse0 .cse31 (+ (- 1) (select .cse0 .cse31) .cse24)))) (let ((.cse49 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse51 |c_ULTIMATE.start_main_~a~0#1.offset| .cse49) .cse1 (+ (- 1) (select .cse51 .cse1)))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse49 .cse50))))))))) .cse16) (< 1 c_~N~0) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (or (< 1 .cse3) .cse2)))))) is different from true [2022-11-02 20:32:02,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:32:04,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:32:11,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:32:13,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:32:16,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []