./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array10_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-patterns/array10_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f --- 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-2329fc7 [2022-12-14 11:24:45,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:24:45,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:24:45,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:24:45,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:24:45,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:24:45,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:24:45,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:24:45,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:24:45,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:24:45,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:24:45,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:24:45,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:24:45,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:24:45,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:24:45,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:24:45,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:24:45,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:24:45,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:24:45,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:24:45,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:24:45,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:24:45,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:24:45,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:24:45,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:24:45,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:24:45,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:24:45,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:24:45,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:24:45,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:24:45,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:24:45,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:24:45,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:24:45,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:24:45,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:24:45,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:24:45,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:24:45,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:24:45,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:24:45,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:24:45,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:24:45,905 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 11:24:45,925 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:24:45,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:24:45,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:24:45,925 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:24:45,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:24:45,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:24:45,934 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:24:45,934 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:24:45,934 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:24:45,935 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 11:24:45,935 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:24:45,935 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:24:45,935 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 11:24:45,935 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 11:24:45,935 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:24:45,936 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 11:24:45,936 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 11:24:45,936 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 11:24:45,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:24:45,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:24:45,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:24:45,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:24:45,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:24:45,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:24:45,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:24:45,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:24:45,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:24:45,939 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 11:24:45,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:24:45,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:24:45,939 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 11:24:45,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 11:24:45,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:24:45,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:24:45,940 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_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/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_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f [2022-12-14 11:24:46,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:24:46,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:24:46,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:24:46,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:24:46,164 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:24:46,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/array-patterns/array10_pattern.c [2022-12-14 11:24:48,761 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:24:48,880 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:24:48,880 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/sv-benchmarks/c/array-patterns/array10_pattern.c [2022-12-14 11:24:48,885 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data/a4a46c504/3c00e17d222847a48788bbba19382746/FLAGb5817f836 [2022-12-14 11:24:48,896 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data/a4a46c504/3c00e17d222847a48788bbba19382746 [2022-12-14 11:24:48,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:24:48,899 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:24:48,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:24:48,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:24:48,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:24:48,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:24:48" (1/1) ... [2022-12-14 11:24:48,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1fd7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:48, skipping insertion in model container [2022-12-14 11:24:48,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:24:48" (1/1) ... [2022-12-14 11:24:48,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:24:48,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:24:49,028 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-12-14 11:24:49,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:24:49,053 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:24:49,065 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-12-14 11:24:49,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:24:49,087 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:24:49,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49 WrapperNode [2022-12-14 11:24:49,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:24:49,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:24:49,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:24:49,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:24:49,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,122 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2022-12-14 11:24:49,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:24:49,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:24:49,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:24:49,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:24:49,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,144 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:24:49,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:24:49,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:24:49,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:24:49,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (1/1) ... [2022-12-14 11:24:49,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:24:49,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:24:49,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:24:49,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:24:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:24:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 11:24:49,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 11:24:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 11:24:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:24:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 11:24:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:24:49,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:24:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 11:24:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:24:49,278 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:24:49,280 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:24:49,428 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:24:49,495 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:24:49,495 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 11:24:49,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:24:49 BoogieIcfgContainer [2022-12-14 11:24:49,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:24:49,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:24:49,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:24:49,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:24:49,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:24:48" (1/3) ... [2022-12-14 11:24:49,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e975f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:24:49, skipping insertion in model container [2022-12-14 11:24:49,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:24:49" (2/3) ... [2022-12-14 11:24:49,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e975f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:24:49, skipping insertion in model container [2022-12-14 11:24:49,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:24:49" (3/3) ... [2022-12-14 11:24:49,506 INFO L112 eAbstractionObserver]: Analyzing ICFG array10_pattern.c [2022-12-14 11:24:49,522 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:24:49,522 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:24:49,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:24:49,561 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cd6bbd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:24:49,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 11:24:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:24:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 11:24:49,569 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:24:49,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:24:49,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:24:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:24:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2131296750, now seen corresponding path program 1 times [2022-12-14 11:24:49,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:24:49,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979990184] [2022-12-14 11:24:49,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:24:49,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:24:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:24:49,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:24:49,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979990184] [2022-12-14 11:24:49,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-12-14 11:24:49,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116842909] [2022-12-14 11:24:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:24:49,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:24:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:24:49,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:24:49,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 11:24:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:24:49,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 11:24:49,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:24:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:24:49,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:24:49,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116842909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:24:49,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:24:49,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:24:49,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336868305] [2022-12-14 11:24:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:24:49,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 11:24:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:24:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 11:24:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:24:49,795 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 11:24:51,821 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-12-14 11:24:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:24:51,832 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-12-14 11:24:51,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 11:24:51,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-12-14 11:24:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:24:51,839 INFO L225 Difference]: With dead ends: 24 [2022-12-14 11:24:51,839 INFO L226 Difference]: Without dead ends: 15 [2022-12-14 11:24:51,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:24:51,842 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:24:51,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 11:24:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-14 11:24:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-14 11:24:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:24:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-12-14 11:24:51,867 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2022-12-14 11:24:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:24:51,868 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-12-14 11:24:51,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 11:24:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2022-12-14 11:24:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 11:24:51,869 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:24:51,869 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:24:51,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:24:52,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:24:52,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:24:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:24:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1788367705, now seen corresponding path program 1 times [2022-12-14 11:24:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:24:52,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099162041] [2022-12-14 11:24:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:24:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:24:52,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 11:24:52,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112173339] [2022-12-14 11:24:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:24:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:24:52,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:24:52,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:24:52,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 11:24:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:24:52,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 11:24:52,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:24:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:24:52,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:24:52,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:24:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099162041] [2022-12-14 11:24:52,258 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 11:24:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112173339] [2022-12-14 11:24:52,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112173339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:24:52,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:24:52,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 11:24:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936486956] [2022-12-14 11:24:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:24:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 11:24:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 11:24:52,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 11:24:52,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 11:24:52,260 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:24:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:24:52,318 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-12-14 11:24:52,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 11:24:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-12-14 11:24:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:24:52,319 INFO L225 Difference]: With dead ends: 30 [2022-12-14 11:24:52,319 INFO L226 Difference]: Without dead ends: 19 [2022-12-14 11:24:52,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 11:24:52,320 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 11:24:52,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:24:52,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-14 11:24:52,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-12-14 11:24:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:24:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-12-14 11:24:52,324 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2022-12-14 11:24:52,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:24:52,325 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-12-14 11:24:52,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:24:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-12-14 11:24:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 11:24:52,325 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:24:52,325 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:24:52,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 11:24:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:24:52,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:24:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:24:52,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1873717572, now seen corresponding path program 1 times [2022-12-14 11:24:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 11:24:52,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795868851] [2022-12-14 11:24:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:24:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 11:24:52,610 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 11:24:52,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154959902] [2022-12-14 11:24:52,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:24:52,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:24:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:24:52,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:24:52,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 11:24:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:24:52,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 11:24:52,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:24:52,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 11:24:52,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:24:52,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 11:24:52,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 11:24:52,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 11:24:53,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:24:53,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 239 [2022-12-14 11:24:53,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:24:53,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:53,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 158 [2022-12-14 11:24:53,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:24:53,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:53,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:53,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:53,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 647 [2022-12-14 11:24:53,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:53,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 410 [2022-12-14 11:24:53,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 87 [2022-12-14 11:24:53,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:24:53,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:53,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:53,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 17 [2022-12-14 11:24:54,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2022-12-14 11:24:54,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:24:54,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:54,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:54,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2022-12-14 11:24:54,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:24:54,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-14 11:24:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:24:54,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:26:29,017 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse52 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse24 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse53 (* .cse52 4))) (let ((.cse23 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse53)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse40 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse53)) (.cse54 (+ .cse24 (- 4294967296)))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse54))) (.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse54)))) (let ((.cse1 (= (mod |c_ULTIMATE.start_main_~index~0#1| 2) 0)) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) (.cse5 (* |c_ULTIMATE.start_main_~sum~0#1| 4)) (.cse37 (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse30 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) (.cse8 (* c_~ARR_SIZE~0 c_~ARR_SIZE~0)) (.cse9 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse0 (<= .cse52 2147483647)) (.cse47 (<= .cse24 2147483647))) (let ((.cse2 (not .cse47)) (.cse25 (not .cse0)) (.cse26 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse51 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse51) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse51 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse9 v_ArrVal_86)))) (.cse31 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse50 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse50) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86))))) (.cse10 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse49 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86))))) (.cse13 (not (<= .cse9 2147483647))) (.cse12 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse48 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse48) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse9 v_ArrVal_86)))) (.cse21 (not .cse1))) (and (or .cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse24)))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (or .cse1 (and (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse4 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse4) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86))))) .cse10 (or (and (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< .cse9 v_ArrVal_86) (< (let ((.cse11 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse11) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8)))) .cse12) .cse13))) (or (let ((.cse17 (mod (select .cse6 .cse7) 4294967296))) (and (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse14 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse14 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse14) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse17 (+ 4294967296 v_ArrVal_86)))) (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse18 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse18) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse17 (+ 4294967296 v_ArrVal_86))))) (or (and (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse19 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse19) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse17 v_ArrVal_86))) (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse20 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse20) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse17 v_ArrVal_86))) .cse2)) (not (<= .cse17 2147483647))))) .cse21))))) (or .cse25 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse24)))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (or .cse1 (and (or (and .cse26 (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< .cse9 v_ArrVal_86) (< (let ((.cse27 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse27) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8))))) .cse13) .cse31 (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse32 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse32) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86)))) .cse2))) (or (let ((.cse34 (mod (select .cse29 .cse30) 4294967296))) (and (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse33 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse33 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse33) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8) (< .cse34 (+ 4294967296 v_ArrVal_86)))) .cse2) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse36 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse36) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse34 (+ 4294967296 v_ArrVal_86)))) (or (and (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse38 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse38) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8) (< .cse34 v_ArrVal_86))) .cse2) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse39 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse39) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse34 v_ArrVal_86)))) (not (<= .cse34 2147483647))))) .cse21))))) (or (and (or .cse25 (and (or .cse1 (and (or .cse26 .cse13) .cse31)) (or (let ((.cse42 (mod (select .cse37 .cse30) 4294967296))) (and (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse41 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse41) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse42 (+ 4294967296 v_ArrVal_86)))) (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse43 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse43) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse43 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse42 v_ArrVal_86))) (not (<= .cse42 2147483647))))) .cse21))) (or .cse0 (and (or .cse1 (and .cse10 (or .cse13 .cse12))) (or (let ((.cse44 (mod (select .cse16 .cse7) 4294967296))) (and (or (not (<= .cse44 2147483647)) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse45 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse45 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse45) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse44 v_ArrVal_86)))) (forall ((v_ArrVal_86 Int)) (or (< .cse44 (+ 4294967296 v_ArrVal_86)) (< (let ((.cse46 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse46) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8))))) .cse21)))) .cse47)))))))) is different from false [2022-12-14 11:26:31,026 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse52 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse24 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse53 (* .cse52 4))) (let ((.cse23 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse53)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse40 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse53)) (.cse54 (+ .cse24 (- 4294967296)))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse54))) (.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse54)))) (let ((.cse1 (= (mod |c_ULTIMATE.start_main_~index~0#1| 2) 0)) (.cse16 (select .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse7 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) (.cse5 (* |c_ULTIMATE.start_main_~sum~0#1| 4)) (.cse37 (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse30 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse53)) (.cse8 (* c_~ARR_SIZE~0 c_~ARR_SIZE~0)) (.cse9 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse0 (<= .cse52 2147483647)) (.cse47 (<= .cse24 2147483647))) (let ((.cse2 (not .cse47)) (.cse25 (not .cse0)) (.cse26 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse51 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse51) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse51 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse9 v_ArrVal_86)))) (.cse31 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse50 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse50) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse50 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86))))) (.cse10 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse49 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86))))) (.cse13 (not (<= .cse9 2147483647))) (.cse12 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse48 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse48 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse48) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse9 v_ArrVal_86)))) (.cse21 (not .cse1))) (and (or .cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse24)))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (or .cse1 (and (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse4 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse4) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86))))) .cse10 (or (and (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< .cse9 v_ArrVal_86) (< (let ((.cse11 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse11) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse11 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8)))) .cse12) .cse13))) (or (let ((.cse17 (mod (select .cse6 .cse7) 4294967296))) (and (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse14 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse14 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse14) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse17 (+ 4294967296 v_ArrVal_86)))) (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse18 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse18) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse18 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse17 (+ 4294967296 v_ArrVal_86))))) (or (and (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse19 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse19 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse19) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse17 v_ArrVal_86))) (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse20 (store .cse6 .cse7 v_ArrVal_86))) (+ (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse20) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse5 (* (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse17 v_ArrVal_86))) .cse2)) (not (<= .cse17 2147483647))))) .cse21))))) (or .cse25 (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse24)))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (or .cse1 (and (or (and .cse26 (or .cse2 (forall ((v_ArrVal_86 Int)) (or (< .cse9 v_ArrVal_86) (< (let ((.cse27 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse27 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse27) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8))))) .cse13) .cse31 (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse32 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse32 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse32) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8) (< .cse9 (+ 4294967296 v_ArrVal_86)))) .cse2))) (or (let ((.cse34 (mod (select .cse29 .cse30) 4294967296))) (and (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse33 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse33 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse33) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8) (< .cse34 (+ 4294967296 v_ArrVal_86)))) .cse2) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse36 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse36) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse36 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse34 (+ 4294967296 v_ArrVal_86)))) (or (and (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse38 (store .cse29 .cse30 v_ArrVal_86))) (+ (* (select .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse5 (* (select (select (store .cse28 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse38) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse8) (< .cse34 v_ArrVal_86))) .cse2) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse39 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse39) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse34 v_ArrVal_86)))) (not (<= .cse34 2147483647))))) .cse21))))) (or (and (or .cse25 (and (or .cse1 (and (or .cse26 .cse13) .cse31)) (or (let ((.cse42 (mod (select .cse37 .cse30) 4294967296))) (and (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse41 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse41) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse41 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse42 (+ 4294967296 v_ArrVal_86)))) (or (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse43 (store .cse37 .cse30 v_ArrVal_86))) (+ (* 4 (select (select (store .cse35 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse43) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse5 (* (select .cse43 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse8) (< .cse42 v_ArrVal_86))) (not (<= .cse42 2147483647))))) .cse21))) (or .cse0 (and (or .cse1 (and .cse10 (or .cse13 .cse12))) (or (let ((.cse44 (mod (select .cse16 .cse7) 4294967296))) (and (or (not (<= .cse44 2147483647)) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse45 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse45 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse45) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8) (< .cse44 v_ArrVal_86)))) (forall ((v_ArrVal_86 Int)) (or (< .cse44 (+ 4294967296 v_ArrVal_86)) (< (let ((.cse46 (store .cse16 .cse7 v_ArrVal_86))) (+ .cse5 (* (select .cse46 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) (* 4 (select (select (store .cse15 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse46) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)))) .cse8))))) .cse21)))) .cse47)))))))) is different from true [2022-12-14 11:26:55,274 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~sum~0#1| 4)) (.cse5 (* c_~ARR_SIZE~0 c_~ARR_SIZE~0)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (and (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse10 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse9 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse10)) (.cse8 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (or (forall ((v_ArrVal_86 Int)) (let ((.cse6 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse6) .cse8)))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse6))) (or (< (mod (select .cse0 .cse1) 4294967296) (+ 4294967296 v_ArrVal_86)) (< (let ((.cse4 (store .cse0 .cse1 v_ArrVal_86))) (+ .cse2 (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse4) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) (* (select .cse4 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse5)))))) (< .cse9 0) (<= c_~ARR_SIZE~0 .cse9) (< .cse10 0) (< 2147483647 .cse10) (not (<= .cse8 2147483647)))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse18 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse11 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse18)) (.cse15 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse17 (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse16 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse18))) (or (< .cse11 0) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse14 (* (mod .cse16 4294967296) 4))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse14 |c_ULTIMATE.start_main_~#array1~0#1.offset|) .cse15)))) (let ((.cse13 (store (select .cse12 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select (select (store .cse12 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse13) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse2 (* (select .cse13 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))))) .cse5) (< .cse17 v_ArrVal_86))) (<= c_~ARR_SIZE~0 .cse11) (< .cse16 0) (not (<= .cse15 2147483647)) (not (<= .cse17 2147483647)) (< 2147483647 .cse16))))) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse25 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse19 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse25)) (.cse20 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse21 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse25))) (or (< .cse19 0) (<= .cse20 2147483647) (<= c_~ARR_SIZE~0 .cse19) (< .cse21 0) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse24 (* (mod .cse21 4294967296) 4))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse24 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ .cse20 (- 4294967296)))))) (let ((.cse23 (store (select .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse24 |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* (select (select (store .cse22 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse23) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* 4 (select .cse23 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))))) .cse5) (< (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (+ 4294967296 v_ArrVal_86)))) (< 2147483647 .cse21))))) (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse32 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse26 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse32)) (.cse31 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse27 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse32))) (or (< .cse26 0) (<= 4294967296 .cse27) (forall ((v_ArrVal_86 Int)) (or (< (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (+ 4294967296 v_ArrVal_86)) (< (let ((.cse30 (* (mod .cse27 4294967296) 4))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse30 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) .cse31)))) (let ((.cse28 (store (select .cse29 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse30 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select .cse28 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) .cse2 (* (select (select (store .cse29 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse28) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))))) .cse5))) (<= c_~ARR_SIZE~0 .cse26) (not (<= .cse31 2147483647)) (<= .cse27 2147483647))))) (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse33 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse34 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse33))) (or (<= .cse33 2147483647) (< .cse34 0) (<= c_~ARR_SIZE~0 .cse34) (forall ((v_ArrVal_86 Int)) (let ((.cse40 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse37 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse40)) (.cse35 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse40)) (.cse36 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (or (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse35 .cse36)) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse37) 4294967296) (+ 4294967296 v_ArrVal_86)) (< (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse35 (+ .cse36 (- 4294967296)))))) (let ((.cse39 (store (select .cse38 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse37 v_ArrVal_86))) (+ (* (select (select (store .cse38 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse39) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse39 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)))) .cse5))))) (<= 4294967296 .cse33))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse49 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8)) (.cse47 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse49) (+ .cse47 (- 4294967296)))))) (let ((.cse48 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|)) (.cse45 (select .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse46 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse49))) (let ((.cse42 (mod (select .cse45 .cse46) 4294967296)) (.cse41 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse48))) (or (< .cse41 0) (not (<= .cse42 2147483647)) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse44 (store .cse45 .cse46 v_ArrVal_86))) (+ (* (select (select (store .cse43 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse44) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse44 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse5) (< .cse42 v_ArrVal_86))) (<= c_~ARR_SIZE~0 .cse41) (<= .cse47 2147483647) (< .cse48 0) (< 2147483647 .cse48))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse57 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse50 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse57)) (.cse56 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (or (< .cse50 0) (forall ((v_ArrVal_86 Int)) (let ((.cse55 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse55) (+ .cse56 (- 4294967296)))))) (let ((.cse53 (select .cse51 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse54 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse55))) (or (< (let ((.cse52 (store .cse53 .cse54 v_ArrVal_86))) (+ (* (select (select (store .cse51 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse52) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse5) (< (mod (select .cse53 .cse54) 4294967296) (+ 4294967296 v_ArrVal_86))))))) (<= c_~ARR_SIZE~0 .cse50) (<= .cse56 2147483647) (< .cse57 0) (< 2147483647 .cse57))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse65 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse58 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse65))) (or (< .cse58 0) (forall ((v_ArrVal_86 Int)) (let ((.cse64 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse62 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse64)) (.cse63 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2)) (.cse61 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse64))) (or (< (let ((.cse59 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse62 (+ .cse63 (- 4294967296)))))) (let ((.cse60 (store (select .cse59 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse61 v_ArrVal_86))) (+ (* (select (select (store .cse59 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse60) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse60 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)))) .cse5) (< (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse62 .cse63)) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse61) 4294967296) (+ 4294967296 v_ArrVal_86)))))) (<= c_~ARR_SIZE~0 .cse58) (< .cse65 0) (< 2147483647 .cse65))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse72 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse71 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse66 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse72)) (.cse67 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse72))) (or (< .cse66 0) (<= 4294967296 .cse67) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse70 (* (mod .cse67 4294967296) 4))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse70 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ .cse71 (- 4294967296)))))) (let ((.cse68 (store (select .cse69 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse70 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select .cse68 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) .cse2 (* (select (select (store .cse69 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse68) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))))) .cse5) (< (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (+ 4294967296 v_ArrVal_86)))) (<= .cse71 2147483647) (<= c_~ARR_SIZE~0 .cse66) (<= .cse67 2147483647))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse81 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse79 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse81)) (.cse80 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2)) (.cse78 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse81)) (.cse73 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse74 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse73)) (.cse75 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse79 .cse80)) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse78) 4294967296))) (or (<= .cse73 2147483647) (< .cse74 0) (<= c_~ARR_SIZE~0 .cse74) (not (<= .cse75 2147483647)) (<= 4294967296 .cse73) (forall ((v_ArrVal_86 Int)) (or (< .cse75 v_ArrVal_86) (< (let ((.cse76 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse79 (+ .cse80 (- 4294967296)))))) (let ((.cse77 (store (select .cse76 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse78 v_ArrVal_86))) (+ (* (select (select (store .cse76 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse77) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse77 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)))) .cse5)))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse90 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8)) (.cse89 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (let ((.cse86 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse90) .cse89)))) (let ((.cse87 (select .cse86 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse88 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse90)) (.cse82 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse83 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse82)) (.cse84 (mod (select .cse87 .cse88) 4294967296))) (or (<= .cse82 2147483647) (< .cse83 0) (<= c_~ARR_SIZE~0 .cse83) (not (<= .cse84 2147483647)) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse85 (store .cse87 .cse88 v_ArrVal_86))) (+ (* (select .cse85 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2 (* (select (select (store .cse86 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse85) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse5) (< .cse84 v_ArrVal_86))) (<= 4294967296 .cse82) (not (<= .cse89 2147483647)))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse99 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse97 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse99)) (.cse98 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2)) (.cse96 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse99)) (.cse93 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse91 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse93)) (.cse92 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse97 .cse98)) |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse96) 4294967296))) (or (< .cse91 0) (<= c_~ARR_SIZE~0 .cse91) (not (<= .cse92 2147483647)) (< .cse93 0) (< 2147483647 .cse93) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse94 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 .cse97 (+ .cse98 (- 4294967296)))))) (let ((.cse95 (store (select .cse94 |c_ULTIMATE.start_main_~#array2~0#1.base|) .cse96 v_ArrVal_86))) (+ (* (select (select (store .cse94 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse95) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse95 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4)))) .cse5) (< .cse92 v_ArrVal_86)))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse107 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse100 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse107)) (.cse101 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse102 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse107)) (.cse103 (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296))) (or (< .cse100 0) (<= .cse101 2147483647) (<= c_~ARR_SIZE~0 .cse100) (< .cse102 0) (not (<= .cse103 2147483647)) (< 2147483647 .cse102) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse106 (* (mod .cse102 4294967296) 4))) (let ((.cse104 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse106 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ .cse101 (- 4294967296)))))) (let ((.cse105 (store (select .cse104 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse106 |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* (select (select (store .cse104 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse105) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* 4 (select .cse105 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))))) .cse5) (< .cse103 v_ArrVal_86))))))) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse115 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse108 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse115)) (.cse113 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse114 (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse109 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse115))) (or (< .cse108 0) (<= 4294967296 .cse109) (<= c_~ARR_SIZE~0 .cse108) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse112 (* (mod .cse109 4294967296) 4))) (let ((.cse111 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse112 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) .cse113)))) (let ((.cse110 (store (select .cse111 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse112 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select .cse110 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) .cse2 (* (select (select (store .cse111 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse110) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))))) .cse5) (< .cse114 v_ArrVal_86))) (not (<= .cse113 2147483647)) (not (<= .cse114 2147483647)) (<= .cse109 2147483647))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse122 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse116 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse122)) (.cse118 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse117 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse122))) (or (< .cse116 0) (<= c_~ARR_SIZE~0 .cse116) (< .cse117 0) (not (<= .cse118 2147483647)) (< 2147483647 .cse117) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse121 (* (mod .cse117 4294967296) 4))) (let ((.cse119 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse121 |c_ULTIMATE.start_main_~#array1~0#1.offset|) .cse118)))) (let ((.cse120 (store (select .cse119 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse121 |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select (select (store .cse119 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse120) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) .cse2 (* (select .cse120 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))))) .cse5) (< (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (+ 4294967296 v_ArrVal_86)))))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse129 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse123 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse129)) (.cse124 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse129)) (.cse125 (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296))) (or (< .cse123 0) (<= c_~ARR_SIZE~0 .cse123) (< .cse124 0) (not (<= .cse125 2147483647)) (< 2147483647 .cse124) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse128 (* (mod .cse124 4294967296) 4))) (let ((.cse126 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse128 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (- 4294967296)))))) (let ((.cse127 (store (select .cse126 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse128 |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* (select (select (store .cse126 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse127) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* 4 (select .cse127 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))))) .cse5) (< .cse125 v_ArrVal_86))))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse138 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8)) (.cse132 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (let ((.cse134 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse138) (+ .cse132 (- 4294967296)))))) (let ((.cse136 (select .cse134 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse137 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse138)) (.cse130 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse131 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse130)) (.cse133 (mod (select .cse136 .cse137) 4294967296))) (or (<= .cse130 2147483647) (< .cse131 0) (<= c_~ARR_SIZE~0 .cse131) (<= .cse132 2147483647) (not (<= .cse133 2147483647)) (<= 4294967296 .cse130) (forall ((v_ArrVal_86 Int)) (or (< .cse133 v_ArrVal_86) (< (let ((.cse135 (store .cse136 .cse137 v_ArrVal_86))) (+ (* (select (select (store .cse134 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse135) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse135 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse5))))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse139 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse140 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse139)) (.cse141 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (or (<= .cse139 2147483647) (< .cse140 0) (<= c_~ARR_SIZE~0 .cse140) (<= .cse141 2147483647) (<= 4294967296 .cse139) (forall ((v_ArrVal_86 Int)) (let ((.cse146 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse144 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse146) (+ .cse141 (- 4294967296)))))) (let ((.cse142 (select .cse144 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse143 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse146))) (or (< (mod (select .cse142 .cse143) 4294967296) (+ 4294967296 v_ArrVal_86)) (< (let ((.cse145 (store .cse142 .cse143 v_ArrVal_86))) (+ (* (select (select (store .cse144 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse145) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* (select .cse145 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse5)))))))))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse147 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse148 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse147)) (.cse154 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (or (<= .cse147 2147483647) (< .cse148 0) (<= c_~ARR_SIZE~0 .cse148) (forall ((v_ArrVal_86 Int)) (let ((.cse153 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8))) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse153) .cse154)))) (let ((.cse151 (select .cse150 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse152 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse153))) (or (< (let ((.cse149 (store .cse151 .cse152 v_ArrVal_86))) (+ (* (select .cse149 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4) .cse2 (* (select (select (store .cse150 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse149) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))) .cse5) (< (mod (select .cse151 .cse152) 4294967296) (+ 4294967296 v_ArrVal_86))))))) (<= 4294967296 .cse147) (not (<= .cse154 2147483647)))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse160 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse155 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse160)) (.cse156 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse160))) (or (< .cse155 0) (<= 4294967296 .cse156) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse159 (* (mod .cse156 4294967296) 4))) (let ((.cse158 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse159 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (- 4294967296)))))) (let ((.cse157 (store (select .cse158 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse159 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select .cse157 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) .cse2 (* (select (select (store .cse158 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse157) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))))) .cse5) (< (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (+ 4294967296 v_ArrVal_86)))) (<= c_~ARR_SIZE~0 .cse155) (<= .cse156 2147483647))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse167 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse161 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse167)) (.cse162 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse167)) (.cse163 (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296))) (or (< .cse161 0) (<= 4294967296 .cse162) (<= c_~ARR_SIZE~0 .cse161) (not (<= .cse163 2147483647)) (<= .cse162 2147483647) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse166 (* (mod .cse162 4294967296) 4))) (let ((.cse165 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse166 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (- 4294967296)))))) (let ((.cse164 (store (select .cse165 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse166 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select .cse164 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) .cse2 (* (select (select (store .cse165 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse164) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))))) .cse5) (< .cse163 v_ArrVal_86))))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse175 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse168 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse175)) (.cse170 (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296)) (.cse169 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse175)) (.cse171 (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296))) (or (< .cse168 0) (<= 4294967296 .cse169) (<= .cse170 2147483647) (<= c_~ARR_SIZE~0 .cse168) (not (<= .cse171 2147483647)) (<= .cse169 2147483647) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse174 (* (mod .cse169 4294967296) 4))) (let ((.cse173 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse174 (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ .cse170 (- 4294967296)))))) (let ((.cse172 (store (select .cse173 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse174 (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* 4 (select .cse172 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) .cse2 (* (select (select (store .cse173 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse172) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4))))) .cse5) (< .cse171 v_ArrVal_86))))))))) (forall ((|aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (or (> 0 |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse181 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse176 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse181)) (.cse177 (+ |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| .cse181))) (or (< .cse176 0) (<= c_~ARR_SIZE~0 .cse176) (< .cse177 0) (forall ((v_ArrVal_86 Int)) (or (< (let ((.cse180 (* (mod .cse177 4294967296) 4))) (let ((.cse178 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ .cse180 |c_ULTIMATE.start_main_~#array1~0#1.offset|) (+ (mod (+ (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (- 4294967296)))))) (let ((.cse179 (store (select .cse178 |c_ULTIMATE.start_main_~#array2~0#1.base|) (+ .cse180 |c_ULTIMATE.start_main_~#array2~0#1.offset|) v_ArrVal_86))) (+ (* (select (select (store .cse178 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse179) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) .cse2 (* 4 (select .cse179 |c_ULTIMATE.start_main_~#array2~0#1.offset|)))))) .cse5) (< (mod (+ (* |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|) (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1|)) 4294967296) (+ 4294967296 v_ArrVal_86)))) (< 2147483647 .cse177))))) (>= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2) (= |aux_mod_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 0))) (forall ((|aux_div_ULTIMATE.start_main_~index~0#1_49| Int) (|aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| Int)) (let ((.cse190 (* (mod |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| 2147483648) 8)) (.cse189 (* (mod (* |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 2147483648) 2))) (let ((.cse184 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse7 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse190) .cse189)))) (let ((.cse186 (select .cse184 |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse187 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse190)) (.cse188 (* 2 |aux_div_aux_mod_ULTIMATE.start_main_~index~0#1_49_51|))) (let ((.cse182 (+ (* |aux_div_ULTIMATE.start_main_~index~0#1_49| 4294967296) .cse188)) (.cse183 (mod (select .cse186 .cse187) 4294967296))) (or (< .cse182 0) (<= c_~ARR_SIZE~0 .cse182) (forall ((v_ArrVal_86 Int)) (or (< .cse183 v_ArrVal_86) (< (let ((.cse185 (store .cse186 .cse187 v_ArrVal_86))) (+ .cse2 (* (select (select (store .cse184 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse185) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|) 4) (* (select .cse185 |c_ULTIMATE.start_main_~#array2~0#1.offset|) 4))) .cse5))) (not (<= .cse183 2147483647)) (< .cse188 0) (< 2147483647 .cse188) (not (<= .cse189 2147483647)))))))))) is different from true [2022-12-14 11:26:55,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 11:26:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795868851] [2022-12-14 11:26:55,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 11:26:55,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154959902] [2022-12-14 11:26:55,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154959902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:26:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1057609547] [2022-12-14 11:26:55,309 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-12-14 11:26:55,309 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 11:26:55,312 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 11:26:55,316 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 11:26:55,317 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 11:26:55,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,440 INFO L321 Elim1Store]: treesize reduction 80, result has 29.8 percent of original size [2022-12-14 11:26:55,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 57 [2022-12-14 11:26:55,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,514 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-12-14 11:26:55,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 44 treesize of output 69 [2022-12-14 11:26:55,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2022-12-14 11:26:55,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:26:55,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:26:55,644 INFO L321 Elim1Store]: treesize reduction 135, result has 12.9 percent of original size [2022-12-14 11:26:55,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 362 treesize of output 348 [2022-12-14 11:26:55,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:26:55,718 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 11:26:55,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 25 [2022-12-14 11:26:55,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:26:55,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:26:55,837 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:26:55,838 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:26:57,830 INFO L321 Elim1Store]: treesize reduction 172, result has 54.4 percent of original size [2022-12-14 11:26:57,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 10 new quantified variables, introduced 8 case distinctions, treesize of input 2455 treesize of output 2707 [2022-12-14 11:28:46,927 INFO L217 Elim1Store]: Index analysis took 2480 ms [2022-12-14 11:29:36,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 11:29:36,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:29:36,934 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 287693 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 287693 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:736) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 59 more [2022-12-14 11:29:36,941 INFO L158 Benchmark]: Toolchain (without parser) took 288041.58ms. Allocated memory was 155.2MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 116.2MB in the beginning and 6.6GB in the end (delta: -6.5GB). Peak memory consumption was 5.8GB. Max. memory is 16.1GB. [2022-12-14 11:29:36,941 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 11:29:36,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.82ms. Allocated memory is still 155.2MB. Free memory was 116.2MB in the beginning and 105.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 11:29:36,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 103.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:29:36,942 INFO L158 Benchmark]: Boogie Preprocessor took 23.59ms. Allocated memory is still 155.2MB. Free memory was 103.6MB in the beginning and 102.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 11:29:36,942 INFO L158 Benchmark]: RCFGBuilder took 349.84ms. Allocated memory is still 155.2MB. Free memory was 102.1MB in the beginning and 85.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 11:29:36,942 INFO L158 Benchmark]: TraceAbstraction took 287440.11ms. Allocated memory was 155.2MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 85.3MB in the beginning and 6.6GB in the end (delta: -6.6GB). Peak memory consumption was 5.8GB. Max. memory is 16.1GB. [2022-12-14 11:29:36,943 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.82ms. Allocated memory is still 155.2MB. Free memory was 116.2MB in the beginning and 105.4MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 155.2MB. Free memory was 105.4MB in the beginning and 103.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.59ms. Allocated memory is still 155.2MB. Free memory was 103.6MB in the beginning and 102.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 349.84ms. Allocated memory is still 155.2MB. Free memory was 102.1MB in the beginning and 85.9MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 287440.11ms. Allocated memory was 155.2MB in the beginning and 12.0GB in the end (delta: 11.8GB). Free memory was 85.3MB in the beginning and 6.6GB in the end (delta: -6.6GB). Peak memory consumption was 5.8GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 287693 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 287693 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-14 11:29:37,148 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-14 11:29:37,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-patterns/array10_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f --- 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-2329fc7 [2022-12-14 11:29:38,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 11:29:38,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 11:29:38,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 11:29:38,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 11:29:38,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 11:29:38,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 11:29:38,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 11:29:38,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 11:29:38,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 11:29:38,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 11:29:38,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 11:29:38,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 11:29:38,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 11:29:38,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 11:29:38,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 11:29:38,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 11:29:38,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 11:29:38,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 11:29:38,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 11:29:38,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 11:29:38,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 11:29:38,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 11:29:38,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 11:29:38,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 11:29:38,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 11:29:38,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 11:29:38,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 11:29:38,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 11:29:38,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 11:29:38,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 11:29:38,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 11:29:38,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 11:29:38,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 11:29:38,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 11:29:38,925 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 11:29:38,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 11:29:38,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 11:29:38,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 11:29:38,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 11:29:38,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 11:29:38,927 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 11:29:38,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 11:29:38,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 11:29:38,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 11:29:38,944 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 11:29:38,944 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 11:29:38,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 11:29:38,945 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 11:29:38,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 11:29:38,945 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 11:29:38,945 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 11:29:38,945 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 11:29:38,945 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 11:29:38,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 11:29:38,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 11:29:38,946 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 11:29:38,946 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 11:29:38,946 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 11:29:38,946 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 11:29:38,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 11:29:38,947 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 11:29:38,947 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 11:29:38,947 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 11:29:38,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 11:29:38,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 11:29:38,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 11:29:38,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 11:29:38,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:29:38,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 11:29:38,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 11:29:38,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 11:29:38,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 11:29:38,949 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/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_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0942a0394519a722254bfe5a1820a904a71ba1b47e3e66c2c8dc2abe6585692f [2022-12-14 11:29:39,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 11:29:39,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 11:29:39,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 11:29:39,167 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 11:29:39,167 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 11:29:39,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/array-patterns/array10_pattern.c [2022-12-14 11:29:41,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 11:29:41,930 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 11:29:41,930 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/sv-benchmarks/c/array-patterns/array10_pattern.c [2022-12-14 11:29:41,936 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data/97bac3564/3d1ed0a4784e425b97de7ac46b947707/FLAGff9208094 [2022-12-14 11:29:42,332 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/data/97bac3564/3d1ed0a4784e425b97de7ac46b947707 [2022-12-14 11:29:42,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 11:29:42,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 11:29:42,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 11:29:42,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 11:29:42,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 11:29:42,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771c16a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42, skipping insertion in model container [2022-12-14 11:29:42,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 11:29:42,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 11:29:42,477 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-12-14 11:29:42,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:29:42,506 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 11:29:42,518 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/sv-benchmarks/c/array-patterns/array10_pattern.c[1326,1339] [2022-12-14 11:29:42,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 11:29:42,542 INFO L208 MainTranslator]: Completed translation [2022-12-14 11:29:42,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42 WrapperNode [2022-12-14 11:29:42,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 11:29:42,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 11:29:42,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 11:29:42,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 11:29:42,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,582 INFO L138 Inliner]: procedures = 18, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-12-14 11:29:42,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 11:29:42,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 11:29:42,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 11:29:42,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 11:29:42,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,610 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 11:29:42,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 11:29:42,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 11:29:42,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 11:29:42,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (1/1) ... [2022-12-14 11:29:42,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 11:29:42,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:29:42,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 11:29:42,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 11:29:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 11:29:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 11:29:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 11:29:42,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 11:29:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 11:29:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 11:29:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 11:29:42,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 11:29:42,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 11:29:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 11:29:42,736 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 11:29:42,738 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 11:29:43,104 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 11:29:43,108 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 11:29:43,108 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 11:29:43,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:29:43 BoogieIcfgContainer [2022-12-14 11:29:43,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 11:29:43,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 11:29:43,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 11:29:43,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 11:29:43,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 11:29:42" (1/3) ... [2022-12-14 11:29:43,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540fb32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:29:43, skipping insertion in model container [2022-12-14 11:29:43,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 11:29:42" (2/3) ... [2022-12-14 11:29:43,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540fb32f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 11:29:43, skipping insertion in model container [2022-12-14 11:29:43,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 11:29:43" (3/3) ... [2022-12-14 11:29:43,118 INFO L112 eAbstractionObserver]: Analyzing ICFG array10_pattern.c [2022-12-14 11:29:43,136 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 11:29:43,136 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 11:29:43,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 11:29:43,173 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@8f4ead9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 11:29:43,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 11:29:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:29:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 11:29:43,181 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:29:43,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:29:43,182 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:29:43,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:29:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1199380475, now seen corresponding path program 1 times [2022-12-14 11:29:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:29:43,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573632862] [2022-12-14 11:29:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:29:43,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:29:43,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:29:43,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:29:43,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 11:29:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:29:43,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 11:29:43,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:29:43,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:43,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:29:43,321 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:29:43,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573632862] [2022-12-14 11:29:43,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573632862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:29:43,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:29:43,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 11:29:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143293781] [2022-12-14 11:29:43,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:29:43,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 11:29:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:29:43,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 11:29:43,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 11:29:43,358 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 11:29:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:29:43,377 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-12-14 11:29:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 11:29:43,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-14 11:29:43,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:29:43,385 INFO L225 Difference]: With dead ends: 51 [2022-12-14 11:29:43,385 INFO L226 Difference]: Without dead ends: 23 [2022-12-14 11:29:43,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-12-14 11:29:43,391 INFO L413 NwaCegarLoop]: 31 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, 31 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-12-14 11:29:43,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 11:29:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-14 11:29:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-14 11:29:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:29:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-12-14 11:29:43,426 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-12-14 11:29:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:29:43,426 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-12-14 11:29:43,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 11:29:43,426 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-12-14 11:29:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 11:29:43,428 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:29:43,428 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:29:43,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 11:29:43,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:29:43,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:29:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:29:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash 966180883, now seen corresponding path program 1 times [2022-12-14 11:29:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:29:43,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641583771] [2022-12-14 11:29:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:29:43,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:29:43,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:29:43,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:29:43,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 11:29:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:29:43,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 11:29:43,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:29:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:44,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 11:29:44,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:29:44,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641583771] [2022-12-14 11:29:44,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641583771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 11:29:44,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 11:29:44,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 11:29:44,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260931420] [2022-12-14 11:29:44,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 11:29:44,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 11:29:44,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:29:44,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 11:29:44,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 11:29:44,059 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:29:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:29:44,345 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-12-14 11:29:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 11:29:44,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-12-14 11:29:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:29:44,352 INFO L225 Difference]: With dead ends: 48 [2022-12-14 11:29:44,352 INFO L226 Difference]: Without dead ends: 31 [2022-12-14 11:29:44,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-14 11:29:44,353 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 11:29:44,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 51 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 11:29:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-14 11:29:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-12-14 11:29:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:29:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-12-14 11:29:44,358 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2022-12-14 11:29:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:29:44,359 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-12-14 11:29:44,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:29:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-12-14 11:29:44,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 11:29:44,359 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:29:44,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:29:44,369 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 11:29:44,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:29:44,561 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:29:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:29:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash -760544265, now seen corresponding path program 1 times [2022-12-14 11:29:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:29:44,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676422629] [2022-12-14 11:29:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:29:44,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:29:44,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:29:44,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:29:44,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 11:29:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:29:44,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 11:29:44,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:29:44,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 11:29:45,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:29:45,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-14 11:29:45,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 11:29:45,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 11:29:47,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:29:47,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-12-14 11:29:50,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:29:50,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2022-12-14 11:29:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:29:51,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:30:09,554 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:30:09,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676422629] [2022-12-14 11:30:09,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676422629] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:30:09,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [642806362] [2022-12-14 11:30:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:30:09,554 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:30:09,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:30:09,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:30:09,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-12-14 11:30:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:30:09,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 11:30:09,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:30:09,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 11:30:10,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:30:10,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-14 11:30:10,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 11:30:11,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 11:30:11,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:30:11,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-12-14 11:30:12,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:30:12,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2022-12-14 11:30:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:30:13,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:30:17,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [642806362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:30:17,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72646068] [2022-12-14 11:30:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 11:30:17,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:30:17,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:30:17,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:30:17,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 11:30:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 11:30:17,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 11:30:17,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:30:20,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 11:30:21,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:30:21,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-14 11:30:21,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 11:30:24,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-12-14 11:30:24,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:30:24,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2022-12-14 11:30:25,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:30:25,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 29 [2022-12-14 11:30:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:30:26,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:30:48,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72646068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:30:48,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 11:30:48,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 28 [2022-12-14 11:30:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907562864] [2022-12-14 11:30:48,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 11:30:48,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 11:30:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:30:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 11:30:48,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1186, Unknown=2, NotChecked=0, Total=1406 [2022-12-14 11:30:48,175 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 24 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 11:31:07,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:31:07,139 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-12-14 11:31:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 11:31:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 24 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 28 [2022-12-14 11:31:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:31:07,156 INFO L225 Difference]: With dead ends: 69 [2022-12-14 11:31:07,156 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 11:31:07,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 64.9s TimeCoverageRelationStatistics Valid=434, Invalid=2014, Unknown=2, NotChecked=0, Total=2450 [2022-12-14 11:31:07,159 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 11:31:07,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 130 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 11:31:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 11:31:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-12-14 11:31:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 11:31:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-12-14 11:31:07,163 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2022-12-14 11:31:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:31:07,164 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-12-14 11:31:07,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 24 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-14 11:31:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-12-14 11:31:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 11:31:07,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:31:07,164 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:31:07,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 11:31:07,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2022-12-14 11:31:07,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-12-14 11:31:07,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:31:07,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:31:07,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:31:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1406627783, now seen corresponding path program 2 times [2022-12-14 11:31:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:31:07,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10074732] [2022-12-14 11:31:07,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:31:07,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:31:07,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:31:07,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:31:07,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 11:31:07,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:31:07,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:31:07,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:31:07,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:31:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:08,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:31:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:31:09,104 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:31:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10074732] [2022-12-14 11:31:09,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10074732] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:31:09,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1219107071] [2022-12-14 11:31:09,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:31:09,105 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:31:09,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:31:09,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:31:09,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-12-14 11:31:09,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:31:09,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:31:09,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 11:31:09,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:31:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:09,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:31:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:31:10,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1219107071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:31:10,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569754969] [2022-12-14 11:31:10,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 11:31:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:31:10,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:31:10,597 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:31:10,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 11:31:10,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 11:31:10,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:31:10,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 11:31:10,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:31:11,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:31:11,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:31:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 11:31:11,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569754969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 11:31:11,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 11:31:11,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 11, 10, 7, 8] total 34 [2022-12-14 11:31:11,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282704097] [2022-12-14 11:31:11,485 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 11:31:11,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 11:31:11,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 11:31:11,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 11:31:11,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 11:31:11,487 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 33 states have internal predecessors, (95), 6 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 11:31:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 11:31:13,415 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-12-14 11:31:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 11:31:13,415 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 33 states have internal predecessors, (95), 6 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 30 [2022-12-14 11:31:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 11:31:13,416 INFO L225 Difference]: With dead ends: 65 [2022-12-14 11:31:13,416 INFO L226 Difference]: Without dead ends: 59 [2022-12-14 11:31:13,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 11:31:13,418 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 237 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 11:31:13,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 147 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 11:31:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-14 11:31:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2022-12-14 11:31:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 11:31:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2022-12-14 11:31:13,429 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 30 [2022-12-14 11:31:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 11:31:13,429 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2022-12-14 11:31:13,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7941176470588234) internal successors, (95), 33 states have internal predecessors, (95), 6 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-12-14 11:31:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-12-14 11:31:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 11:31:13,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 11:31:13,430 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 11:31:13,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-14 11:31:13,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 11:31:13,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-12-14 11:31:14,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 11:31:14,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 11:31:14,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 11:31:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1198632411, now seen corresponding path program 3 times [2022-12-14 11:31:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 11:31:14,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378972065] [2022-12-14 11:31:14,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:31:14,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 11:31:14,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 11:31:14,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 11:31:14,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 11:31:14,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 11:31:14,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:31:14,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 11:31:14,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:31:14,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 11:31:14,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:14,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-14 11:31:14,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 11:31:14,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:14,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2022-12-14 11:31:19,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:20,191 INFO L321 Elim1Store]: treesize reduction 31, result has 34.0 percent of original size [2022-12-14 11:31:20,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2022-12-14 11:31:28,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:28,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:28,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:28,287 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-14 11:31:28,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 80 [2022-12-14 11:31:52,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:52,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:31:52,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:31:52,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:31:52,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 67 [2022-12-14 11:32:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:32:03,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:32:44,387 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 11:32:44,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378972065] [2022-12-14 11:32:44,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378972065] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 11:32:44,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [277400411] [2022-12-14 11:32:44,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:32:44,387 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 11:32:44,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 11:32:44,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 11:32:44,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-12-14 11:32:44,753 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 11:32:44,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364445649] [2022-12-14 11:32:44,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 11:32:44,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 11:32:44,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 11:32:44,755 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 11:32:44,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 11:32:44,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6399dcfe-bdbd-4bcf-ae2b-b34bb41d77cc/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 1 [2022-12-14 11:32:45,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 11:32:45,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 11:32:45,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 11:32:45,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 11:32:45,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 11:32:46,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:32:46,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-14 11:32:46,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 11:32:49,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:32:49,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 11:32:49,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2022-12-14 11:32:49,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:32:49,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2022-12-14 11:32:49,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-12-14 11:32:57,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:32:57,979 INFO L321 Elim1Store]: treesize reduction 31, result has 34.0 percent of original size [2022-12-14 11:32:57,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 67 [2022-12-14 11:33:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:06,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:06,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:06,910 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-12-14 11:33:06,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 80 [2022-12-14 11:33:14,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 11:33:14,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:14,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 11:33:14,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 11:33:14,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 67 [2022-12-14 11:33:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 11:33:16,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 11:33:59,647 WARN L837 $PredicateComparison]: unable to prove that (or (not (bvslt ((_ sign_extend 32) (_ bv1 32)) c_~ARR_SIZE~0)) (bvslt ((_ sign_extend 32) (_ bv2 32)) c_~ARR_SIZE~0) (let ((.cse7 (bvmul (bvadd (_ bv1 64) c_~ARR_SIZE~0) (bvadd (_ bv18446744073709551615 64) c_~ARR_SIZE~0)))) (and (forall ((|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (bvslt |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| c_~ARR_SIZE~0) (not (= (_ bv0 64) (bvsrem |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv2 64)))) (bvsle (let ((.cse5 (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5|)))) (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6| (store (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6|) (bvadd |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6| .cse5) ((_ extract 31 0) (let ((.cse6 ((_ sign_extend 32) |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2|))) (bvmul (bvmul (bvmul (bvmul |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| .cse6) .cse6) .cse6) .cse6))))))) (let ((.cse0 (let ((.cse3 (select .cse2 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_6|)) (.cse4 (bvadd |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6| .cse5))) (store .cse3 .cse4 ((_ extract 31 0) ((_ sign_extend 32) (select .cse3 .cse4))))))) (let ((.cse1 (select (store .cse2 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_6| .cse0) |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6|))) (bvadd (bvmul ((_ sign_extend 32) (select .cse0 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6|))) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse1 |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse0 |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6|))) (bvmul |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_6| (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse1 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6|))))))))) .cse7))) (forall ((|v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ BitVec 64)) (|v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (or (bvsge |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv0 64)) (not (= (_ bv0 64) (bvsrem |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| (_ bv2 64)))) (bvsle (let ((.cse13 (bvmul (_ bv4 32) ((_ extract 31 0) |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5|)))) (let ((.cse10 (store |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6| (store (select |c_#memory_int| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6|) (bvadd |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6| .cse13) ((_ extract 31 0) (let ((.cse14 ((_ sign_extend 32) |v_ULTIMATE.start_main_~num~0#1_BEFORE_CALL_2|))) (bvmul (bvmul (bvmul (bvmul |v_ULTIMATE.start_main_~index~0#1_BEFORE_CALL_5| .cse14) .cse14) .cse14) .cse14))))))) (let ((.cse8 (let ((.cse11 (select .cse10 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_6|)) (.cse12 (bvadd |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6| .cse13))) (store .cse11 .cse12 ((_ extract 31 0) ((_ sign_extend 32) (select .cse11 .cse12))))))) (let ((.cse9 (select (store .cse10 |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_6| .cse8) |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_6|))) (bvadd (bvmul ((_ sign_extend 32) (select .cse8 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6|))) (_ bv4 64)) (bvmul ((_ sign_extend 32) (select .cse9 |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6|)) (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse8 |v_ULTIMATE.start_main_~#array2~0#1.offset_BEFORE_CALL_6|))) (bvmul |v_ULTIMATE.start_main_~sum~0#1_BEFORE_CALL_6| (_ bv4 64)) (bvmul (_ bv4 64) ((_ sign_extend 32) (select .cse9 (bvadd (_ bv4 32) |v_ULTIMATE.start_main_~#array1~0#1.offset_BEFORE_CALL_6|))))))))) .cse7))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2022-12-14 11:34:58,960 WARN L233 SmtUtils]: Spent 21.81s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 11:35:28,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18102 treesize of output 17878 [2022-12-14 11:35:42,421 WARN L233 SmtUtils]: Spent 11.12s on a formula simplification. DAG size of input: 48 DAG size of output: 28 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-14 11:35:42,422 INFO L321 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2022-12-14 11:35:42,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 544458141072 treesize of output 526351365400