./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:54:38,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:54:38,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:54:38,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:54:38,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:54:38,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:54:38,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:54:38,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:54:38,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:54:38,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:54:38,105 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:54:38,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:54:38,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:54:38,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:54:38,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:54:38,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:54:38,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:54:38,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:54:38,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:54:38,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:54:38,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:54:38,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:54:38,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:54:38,134 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:54:38,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:54:38,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:54:38,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:54:38,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:54:38,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:54:38,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:54:38,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:54:38,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:54:38,148 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:54:38,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:54:38,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:54:38,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:54:38,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:54:38,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:54:38,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:54:38,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:54:38,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:54:38,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-20 20:54:38,175 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:54:38,176 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:54:38,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:54:38,177 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:54:38,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:54:38,178 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:54:38,178 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:54:38,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:54:38,179 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:54:38,179 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:54:38,180 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:54:38,181 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:54:38,181 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:54:38,181 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:54:38,182 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:54:38,182 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:54:38,182 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:54:38,182 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:54:38,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:54:38,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:54:38,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:54:38,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:54:38,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:54:38,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:54:38,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:54:38,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:54:38,186 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:54:38,186 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:54:38,187 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:54:38,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:54:38,187 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:54:38,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:54:38,188 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:54:38,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:54:38,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:54:38,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:54:38,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:54:38,189 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:54:38,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:54:38,190 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:54:38,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:54:38,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:54:38,191 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_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2022-11-20 20:54:38,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:54:38,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:54:38,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:54:38,488 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:54:38,489 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:54:38,490 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-20 20:54:41,629 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:54:41,932 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:54:41,933 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-20 20:54:41,950 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data/9991d0a94/ca6bf8290f93442e83a2df018435d978/FLAGf1a79893e [2022-11-20 20:54:41,969 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data/9991d0a94/ca6bf8290f93442e83a2df018435d978 [2022-11-20 20:54:41,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:54:41,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:54:41,981 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:54:41,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:54:41,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:54:41,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:41" (1/1) ... [2022-11-20 20:54:41,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f6c793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:41, skipping insertion in model container [2022-11-20 20:54:41,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:41" (1/1) ... [2022-11-20 20:54:41,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:54:42,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:54:42,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:54:42,402 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-11-20 20:54:42,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4a3e1249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:42, skipping insertion in model container [2022-11-20 20:54:42,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:54:42,403 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-20 20:54:42,405 INFO L158 Benchmark]: Toolchain (without parser) took 428.00ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 98.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 20:54:42,406 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 98.6MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 20:54:42,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.05ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 98.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 20:54:42,409 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.26ms. Allocated memory is still 98.6MB. Free memory was 50.3MB in the beginning and 50.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.05ms. Allocated memory is still 155.2MB. Free memory was 109.7MB in the beginning and 98.6MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:54:44,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:54:44,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:54:44,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:54:44,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:54:44,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:54:44,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:54:44,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:54:44,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:54:44,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:54:44,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:54:44,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:54:44,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:54:44,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:54:44,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:54:44,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:54:44,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:54:44,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:54:44,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:54:44,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:54:44,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:54:44,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:54:44,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:54:44,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:54:44,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:54:44,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:54:44,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:54:44,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:54:44,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:54:44,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:54:44,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:54:44,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:54:44,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:54:44,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:54:44,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:54:44,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:54:44,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:54:44,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:54:44,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:54:44,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:54:44,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:54:44,887 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-20 20:54:44,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:54:44,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:54:44,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:54:44,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:54:44,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:54:44,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:54:44,934 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:54:44,935 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:54:44,935 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:54:44,935 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:54:44,936 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:54:44,936 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:54:44,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 20:54:44,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 20:54:44,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:54:44,938 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:54:44,938 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 20:54:44,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:54:44,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:54:44,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:54:44,938 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 20:54:44,939 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 20:54:44,939 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 20:54:44,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:54:44,939 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 20:54:44,939 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 20:54:44,939 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 20:54:44,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:54:44,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:54:44,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:54:44,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 20:54:44,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:54:44,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:54:44,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:54:44,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:54:44,941 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-20 20:54:44,941 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 20:54:44,942 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:54:44,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 20:54:44,942 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_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2022-11-20 20:54:45,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:54:45,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:54:45,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:54:45,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:54:45,378 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:54:45,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-20 20:54:48,652 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:54:48,995 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:54:48,996 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-20 20:54:49,025 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data/fbb4dfd86/db500145b8504aeb9e1e4ff9f838b9b5/FLAG60d08c505 [2022-11-20 20:54:49,047 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/data/fbb4dfd86/db500145b8504aeb9e1e4ff9f838b9b5 [2022-11-20 20:54:49,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:54:49,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:54:49,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:54:49,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:54:49,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:54:49,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9db67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49, skipping insertion in model container [2022-11-20 20:54:49,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:54:49,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:54:49,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:54:49,546 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-20 20:54:49,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:54:49,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:54:49,581 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:54:49,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:54:49,655 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:54:49,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49 WrapperNode [2022-11-20 20:54:49,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:54:49,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:54:49,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:54:49,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:54:49,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,704 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-11-20 20:54:49,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:54:49,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:54:49,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:54:49,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:54:49,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,736 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:54:49,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:54:49,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:54:49,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:54:49,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (1/1) ... [2022-11-20 20:54:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:54:49,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:54:49,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:54:49,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:54:49,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:54:49,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 20:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 20:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:54:49,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 20:54:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 20:54:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 20:54:49,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:54:49,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:54:49,981 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:54:49,983 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:54:50,554 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:54:50,561 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:54:50,561 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 20:54:50,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:50 BoogieIcfgContainer [2022-11-20 20:54:50,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:54:50,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:54:50,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:54:50,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:54:50,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:54:49" (1/3) ... [2022-11-20 20:54:50,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222764af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:50, skipping insertion in model container [2022-11-20 20:54:50,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:54:49" (2/3) ... [2022-11-20 20:54:50,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222764af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:54:50, skipping insertion in model container [2022-11-20 20:54:50,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:54:50" (3/3) ... [2022-11-20 20:54:50,572 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2022-11-20 20:54:50,591 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:54:50,591 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-20 20:54:50,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:54:50,645 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5f073039, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:54:50,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-20 20:54:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:50,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 20:54:50,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:50,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 20:54:50,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:50,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:50,661 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-11-20 20:54:50,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:50,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109814324] [2022-11-20 20:54:50,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:50,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:50,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:50,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:50,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 20:54:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:50,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 20:54:50,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:50,897 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 6 treesize of output 7 [2022-11-20 20:54:50,986 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:54:50,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 20:54:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:51,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:51,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:51,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2109814324] [2022-11-20 20:54:51,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2109814324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:51,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:51,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:54:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635477330] [2022-11-20 20:54:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:51,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:54:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:51,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:54:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:54:51,084 INFO L87 Difference]: Start difference. First operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:51,553 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-11-20 20:54:51,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:54:51,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 20:54:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:51,570 INFO L225 Difference]: With dead ends: 148 [2022-11-20 20:54:51,570 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 20:54:51,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:54:51,576 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:51,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:54:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 20:54:51,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2022-11-20 20:54:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-20 20:54:51,634 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2022-11-20 20:54:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:51,635 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-20 20:54:51,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-20 20:54:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 20:54:51,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:51,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 20:54:51,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:51,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:51,850 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:51,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-11-20 20:54:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:51,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263280479] [2022-11-20 20:54:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:51,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:51,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 20:54:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:51,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 20:54:51,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:51,959 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 6 treesize of output 7 [2022-11-20 20:54:51,968 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 6 treesize of output 5 [2022-11-20 20:54:52,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:54:52,024 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 12 treesize of output 14 [2022-11-20 20:54:52,037 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:54:52,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:54:52,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:52,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:52,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:52,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263280479] [2022-11-20 20:54:52,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263280479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:52,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:52,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:54:52,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047361975] [2022-11-20 20:54:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:52,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:54:52,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:52,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:54:52,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:54:52,067 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:52,680 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-11-20 20:54:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:54:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 20:54:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:52,684 INFO L225 Difference]: With dead ends: 236 [2022-11-20 20:54:52,684 INFO L226 Difference]: Without dead ends: 236 [2022-11-20 20:54:52,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:54:52,685 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 239 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:52,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 97 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 20:54:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-20 20:54:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2022-11-20 20:54:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2022-11-20 20:54:52,702 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2022-11-20 20:54:52,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:52,702 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2022-11-20 20:54:52,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:52,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2022-11-20 20:54:52,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:54:52,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:52,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:54:52,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:52,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:52,920 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:52,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:52,921 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-11-20 20:54:52,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:52,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248156334] [2022-11-20 20:54:52,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:52,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:52,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:52,923 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:52,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 20:54:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:53,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:54:53,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:53,014 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 6 treesize of output 7 [2022-11-20 20:54:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:53,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:53,024 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:53,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248156334] [2022-11-20 20:54:53,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248156334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:53,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:53,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:54:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287781393] [2022-11-20 20:54:53,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:53,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:54:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:53,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:54:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:54:53,026 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:53,258 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-20 20:54:53,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:54:53,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 20:54:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:53,259 INFO L225 Difference]: With dead ends: 136 [2022-11-20 20:54:53,259 INFO L226 Difference]: Without dead ends: 136 [2022-11-20 20:54:53,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:54:53,261 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:53,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 87 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:54:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-20 20:54:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-11-20 20:54:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-20 20:54:53,267 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2022-11-20 20:54:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:53,268 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-20 20:54:53,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-20 20:54:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 20:54:53,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:53,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 20:54:53,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:53,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:53,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:53,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-11-20 20:54:53,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:53,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519634089] [2022-11-20 20:54:53,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:53,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:53,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:53,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 20:54:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:53,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 20:54:53,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:53,583 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 6 treesize of output 5 [2022-11-20 20:54:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:53,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:53,600 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:53,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519634089] [2022-11-20 20:54:53,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519634089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:53,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:53,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:54:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838169811] [2022-11-20 20:54:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:53,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:54:53,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:53,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:54:53,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:54:53,603 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:53,961 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-11-20 20:54:53,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:54:53,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 20:54:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:53,964 INFO L225 Difference]: With dead ends: 180 [2022-11-20 20:54:53,964 INFO L226 Difference]: Without dead ends: 180 [2022-11-20 20:54:53,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:54:53,966 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:53,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:54:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-20 20:54:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2022-11-20 20:54:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-11-20 20:54:53,975 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2022-11-20 20:54:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:53,975 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-11-20 20:54:53,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-11-20 20:54:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:54:53,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:53,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:53,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-20 20:54:54,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:54,188 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2022-11-20 20:54:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:54,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818817813] [2022-11-20 20:54:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:54,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:54,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:54,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:54,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (6)] Waiting until timeout for monitored process [2022-11-20 20:54:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:54,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:54:54,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:54,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-20 20:54:54,320 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 20:54:54,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 20:54:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:54,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:54,339 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:54,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818817813] [2022-11-20 20:54:54,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818817813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:54,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:54,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 20:54:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620957132] [2022-11-20 20:54:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:54,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 20:54:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:54,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 20:54:54,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:54:54,342 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:54,573 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-11-20 20:54:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:54:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 20:54:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:54,575 INFO L225 Difference]: With dead ends: 151 [2022-11-20 20:54:54,575 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 20:54:54,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 20:54:54,576 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 69 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:54,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:54:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 20:54:54,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2022-11-20 20:54:54,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-11-20 20:54:54,584 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2022-11-20 20:54:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:54,584 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-11-20 20:54:54,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-11-20 20:54:54,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 20:54:54,585 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:54,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:54,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:54,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:54,797 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2022-11-20 20:54:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:54,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872727248] [2022-11-20 20:54:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:54,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:54,800 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:54,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 20:54:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:54,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 20:54:54,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:54,896 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 6 treesize of output 5 [2022-11-20 20:54:54,903 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 6 treesize of output 7 [2022-11-20 20:54:54,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:54:54,937 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 12 treesize of output 14 [2022-11-20 20:54:54,951 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:54:54,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:54:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:54,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:54,965 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:54,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872727248] [2022-11-20 20:54:54,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872727248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:54,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:54,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:54:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557325872] [2022-11-20 20:54:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:54,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:54:54,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:54,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:54:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:54:54,967 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:55,371 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-11-20 20:54:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:54:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 20:54:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:55,373 INFO L225 Difference]: With dead ends: 200 [2022-11-20 20:54:55,373 INFO L226 Difference]: Without dead ends: 200 [2022-11-20 20:54:55,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:54:55,375 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 187 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:55,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 166 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:54:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-20 20:54:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2022-11-20 20:54:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-11-20 20:54:55,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2022-11-20 20:54:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:55,382 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-11-20 20:54:55,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-11-20 20:54:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:54:55,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:55,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:55,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:55,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:55,599 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:55,600 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2022-11-20 20:54:55,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:55,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595378028] [2022-11-20 20:54:55,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:55,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:55,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:55,602 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:55,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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)] Waiting until timeout for monitored process [2022-11-20 20:54:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:55,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 20:54:55,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:55,712 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 6 treesize of output 7 [2022-11-20 20:54:55,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:54:55,763 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 23 treesize of output 11 [2022-11-20 20:54:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:55,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:55,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:55,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595378028] [2022-11-20 20:54:55,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595378028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:55,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:55,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:54:55,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634278571] [2022-11-20 20:54:55,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:55,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:54:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:55,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:54:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:54:55,780 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:56,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:56,143 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-11-20 20:54:56,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:54:56,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 20:54:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:56,144 INFO L225 Difference]: With dead ends: 109 [2022-11-20 20:54:56,144 INFO L226 Difference]: Without dead ends: 109 [2022-11-20 20:54:56,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:54:56,145 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:56,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 216 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:54:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-20 20:54:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-11-20 20:54:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-11-20 20:54:56,151 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2022-11-20 20:54:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:56,151 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-11-20 20:54:56,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-11-20 20:54:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 20:54:56,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:56,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:56,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:56,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:56,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:56,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2022-11-20 20:54:56,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:56,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829263815] [2022-11-20 20:54:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:56,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:56,366 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:56,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (9)] Waiting until timeout for monitored process [2022-11-20 20:54:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:56,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 20:54:56,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:56,482 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 6 treesize of output 5 [2022-11-20 20:54:56,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:54:56,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:54:56,601 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 21 treesize of output 9 [2022-11-20 20:54:56,605 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 19 treesize of output 7 [2022-11-20 20:54:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:56,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:56,630 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:56,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829263815] [2022-11-20 20:54:56,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829263815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:56,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:56,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:54:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483079688] [2022-11-20 20:54:56,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:56,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:54:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:56,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:54:56,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:54:56,633 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:57,090 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-11-20 20:54:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:54:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 20:54:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:57,092 INFO L225 Difference]: With dead ends: 104 [2022-11-20 20:54:57,092 INFO L226 Difference]: Without dead ends: 104 [2022-11-20 20:54:57,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:54:57,093 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:57,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 218 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:54:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-20 20:54:57,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-11-20 20:54:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-11-20 20:54:57,098 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2022-11-20 20:54:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:57,098 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-11-20 20:54:57,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-11-20 20:54:57,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 20:54:57,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:57,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:57,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:57,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:57,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2022-11-20 20:54:57,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:57,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096766286] [2022-11-20 20:54:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:57,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:57,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:57,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:57,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 20:54:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:57,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 20:54:57,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:57,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:54:57,546 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 14 treesize of output 16 [2022-11-20 20:54:57,566 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:54:57,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:54:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:57,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:57,646 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:57,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096766286] [2022-11-20 20:54:57,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096766286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:57,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:57,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:54:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664649856] [2022-11-20 20:54:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:57,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:54:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:54:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:54:57,648 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:57,949 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-20 20:54:57,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:54:57,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 20:54:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:57,950 INFO L225 Difference]: With dead ends: 133 [2022-11-20 20:54:57,951 INFO L226 Difference]: Without dead ends: 133 [2022-11-20 20:54:57,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-20 20:54:57,952 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 426 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:57,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 65 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:54:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-20 20:54:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2022-11-20 20:54:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-11-20 20:54:57,962 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2022-11-20 20:54:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:57,963 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-11-20 20:54:57,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-11-20 20:54:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:54:57,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:57,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:57,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:58,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:58,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2022-11-20 20:54:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:58,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750635982] [2022-11-20 20:54:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:58,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:58,178 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:58,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-20 20:54:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:58,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 20:54:58,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:58,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:54:58,399 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 16 treesize of output 8 [2022-11-20 20:54:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:58,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:58,410 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:58,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750635982] [2022-11-20 20:54:58,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750635982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:58,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:58,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 20:54:58,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853888446] [2022-11-20 20:54:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:58,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:54:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:58,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:54:58,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:54:58,413 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:58,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:58,695 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-11-20 20:54:58,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:54:58,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 20:54:58,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:58,696 INFO L225 Difference]: With dead ends: 137 [2022-11-20 20:54:58,696 INFO L226 Difference]: Without dead ends: 137 [2022-11-20 20:54:58,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:54:58,697 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 168 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:58,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:54:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-20 20:54:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2022-11-20 20:54:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-20 20:54:58,702 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2022-11-20 20:54:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:58,702 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-20 20:54:58,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-20 20:54:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:54:58,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:58,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:58,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:54:58,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:58,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2022-11-20 20:54:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:58,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939066349] [2022-11-20 20:54:58,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:58,922 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:58,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (12)] Waiting until timeout for monitored process [2022-11-20 20:54:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:59,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:54:59,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:59,046 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 6 treesize of output 7 [2022-11-20 20:54:59,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:54:59,191 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 19 treesize of output 11 [2022-11-20 20:54:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:54:59,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:54:59,204 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:54:59,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939066349] [2022-11-20 20:54:59,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939066349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:54:59,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:54:59,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:54:59,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330140818] [2022-11-20 20:54:59,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:54:59,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:54:59,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:54:59,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:54:59,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:54:59,207 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:59,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:54:59,648 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-20 20:54:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:54:59,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 20:54:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:54:59,650 INFO L225 Difference]: With dead ends: 129 [2022-11-20 20:54:59,650 INFO L226 Difference]: Without dead ends: 129 [2022-11-20 20:54:59,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:54:59,651 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:54:59,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:54:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-20 20:54:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2022-11-20 20:54:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-11-20 20:54:59,654 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2022-11-20 20:54:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:54:59,654 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-11-20 20:54:59,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:54:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-11-20 20:54:59,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 20:54:59,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:54:59,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:54:59,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (12)] Ended with exit code 0 [2022-11-20 20:54:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:59,866 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:54:59,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:54:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2022-11-20 20:54:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:54:59,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106530113] [2022-11-20 20:54:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:54:59,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:54:59,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:54:59,868 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:54:59,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-20 20:54:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:54:59,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 20:54:59,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:54:59,985 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 6 treesize of output 5 [2022-11-20 20:55:00,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:00,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:00,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 20:55:00,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:55:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:00,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:55:00,218 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:55:00,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106530113] [2022-11-20 20:55:00,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106530113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:55:00,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:55:00,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:55:00,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351475384] [2022-11-20 20:55:00,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:55:00,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:55:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:55:00,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:55:00,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:55:00,220 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:00,823 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-11-20 20:55:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:55:00,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-20 20:55:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:00,825 INFO L225 Difference]: With dead ends: 201 [2022-11-20 20:55:00,825 INFO L226 Difference]: Without dead ends: 201 [2022-11-20 20:55:00,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:55:00,825 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:00,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 221 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 20:55:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-20 20:55:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2022-11-20 20:55:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-11-20 20:55:00,829 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2022-11-20 20:55:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:00,829 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-11-20 20:55:00,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-11-20 20:55:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:55:00,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:00,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:00,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:01,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:01,042 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:55:01,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:01,042 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2022-11-20 20:55:01,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:55:01,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462838429] [2022-11-20 20:55:01,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:01,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:01,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:55:01,044 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:55:01,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-20 20:55:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:01,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 20:55:01,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:01,214 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 6 treesize of output 7 [2022-11-20 20:55:01,247 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 20:55:01,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 20:55:01,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:01,418 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:01,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 20:55:01,469 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 33 treesize of output 15 [2022-11-20 20:55:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:55:01,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:01,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-20 20:55:01,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-20 20:55:01,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:01,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 20:55:01,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-20 20:55:01,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:55:06,309 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:55:06,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462838429] [2022-11-20 20:55:06,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462838429] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:06,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [215414364] [2022-11-20 20:55:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:06,309 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:55:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:55:06,312 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:55:06,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-20 20:55:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:06,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 20:55:06,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:06,609 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 6 treesize of output 7 [2022-11-20 20:55:06,636 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 20:55:06,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 20:55:06,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:06,760 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:06,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 20:55:06,819 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 33 treesize of output 15 [2022-11-20 20:55:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:55:06,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:08,943 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_301) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-20 20:55:08,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:08,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 20:55:08,983 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 44 treesize of output 32 [2022-11-20 20:55:09,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:55:09,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [215414364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:09,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679066853] [2022-11-20 20:55:09,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:09,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:09,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:09,063 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:09,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 20:55:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:09,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 20:55:09,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:09,200 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 6 treesize of output 7 [2022-11-20 20:55:09,235 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-20 20:55:09,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-20 20:55:09,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:09,361 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:09,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 20:55:09,420 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 33 treesize of output 15 [2022-11-20 20:55:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 20:55:09,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:11,538 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:11,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-20 20:55:11,543 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 44 treesize of output 32 [2022-11-20 20:55:11,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 20:55:11,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679066853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:11,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:55:11,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7, 6, 7] total 14 [2022-11-20 20:55:11,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791077833] [2022-11-20 20:55:11,613 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:11,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 20:55:11,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:55:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 20:55:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=97, Unknown=5, NotChecked=66, Total=210 [2022-11-20 20:55:11,614 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:12,404 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-20 20:55:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 20:55:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:55:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:12,406 INFO L225 Difference]: With dead ends: 151 [2022-11-20 20:55:12,406 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 20:55:12,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=59, Invalid=130, Unknown=5, NotChecked=78, Total=272 [2022-11-20 20:55:12,407 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 136 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:12,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 597 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 494 Unchecked, 0.6s Time] [2022-11-20 20:55:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 20:55:12,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2022-11-20 20:55:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-11-20 20:55:12,411 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2022-11-20 20:55:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:12,411 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-11-20 20:55:12,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-11-20 20:55:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 20:55:12,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:12,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:12,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:12,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:12,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:13,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:13,013 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:55:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2022-11-20 20:55:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:55:13,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283436702] [2022-11-20 20:55:13,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:55:13,015 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:55:13,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (17)] Waiting until timeout for monitored process [2022-11-20 20:55:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:13,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 20:55:13,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:13,214 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 6 treesize of output 7 [2022-11-20 20:55:13,248 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:55:13,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:55:13,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:55:13,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:13,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:13,507 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:13,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:55:13,527 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 22 treesize of output 24 [2022-11-20 20:55:13,659 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 31 treesize of output 13 [2022-11-20 20:55:13,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-20 20:55:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:13,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:14,154 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_384) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2022-11-20 20:55:14,211 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_384) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse3) (bvadd (_ bv8 32) .cse0 .cse3))))))) is different from false [2022-11-20 20:55:14,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_384) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2022-11-20 20:55:14,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:14,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-20 20:55:14,336 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:14,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-20 20:55:14,343 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 62 treesize of output 50 [2022-11-20 20:55:14,353 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 96 treesize of output 78 [2022-11-20 20:55:14,368 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 40 treesize of output 32 [2022-11-20 20:55:14,371 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 66 treesize of output 58 [2022-11-20 20:55:14,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:14,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-20 20:55:14,519 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 54 treesize of output 36 [2022-11-20 20:55:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:55:14,744 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:55:14,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283436702] [2022-11-20 20:55:14,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283436702] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:14,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2059246245] [2022-11-20 20:55:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:14,745 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:55:14,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:55:14,747 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:55:14,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-20 20:55:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:15,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 20:55:15,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:15,014 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 6 treesize of output 7 [2022-11-20 20:55:15,038 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:55:15,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:55:15,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:55:15,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:15,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:15,184 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:15,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:55:15,202 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 22 treesize of output 24 [2022-11-20 20:55:15,310 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 31 treesize of output 13 [2022-11-20 20:55:15,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-20 20:55:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:15,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:15,481 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-20 20:55:15,543 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-20 20:55:15,610 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-20 20:55:15,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:15,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-20 20:55:15,642 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 54 treesize of output 36 [2022-11-20 20:55:15,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:15,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-20 20:55:15,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:15,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-20 20:55:15,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:55:15,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 33 treesize of output 21 [2022-11-20 20:55:15,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:55:15,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-20 20:55:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:55:15,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2059246245] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:15,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165390473] [2022-11-20 20:55:15,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:55:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:55:15,733 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:55:15,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 20:55:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:15,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 20:55:15,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:15,886 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 6 treesize of output 7 [2022-11-20 20:55:15,899 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 6 treesize of output 5 [2022-11-20 20:55:15,918 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:55:15,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:55:15,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:15,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:16,078 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:16,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:55:16,096 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 22 treesize of output 24 [2022-11-20 20:55:16,175 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 31 treesize of output 13 [2022-11-20 20:55:16,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-20 20:55:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:16,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:16,330 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_470) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-20 20:55:16,374 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_470) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-20 20:55:16,438 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_470) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-20 20:55:16,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:16,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-20 20:55:16,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:16,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-20 20:55:16,474 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 62 treesize of output 50 [2022-11-20 20:55:16,479 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 96 treesize of output 78 [2022-11-20 20:55:16,490 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 40 treesize of output 32 [2022-11-20 20:55:16,493 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 66 treesize of output 58 [2022-11-20 20:55:16,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:16,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-20 20:55:16,639 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 54 treesize of output 36 [2022-11-20 20:55:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-20 20:55:16,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165390473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:55:16,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:55:16,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 21 [2022-11-20 20:55:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440581775] [2022-11-20 20:55:16,809 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:55:16,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 20:55:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:55:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 20:55:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=130, Unknown=9, NotChecked=270, Total=462 [2022-11-20 20:55:16,810 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:20,719 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-11-20 20:55:20,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:55:20,720 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 20:55:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:20,721 INFO L225 Difference]: With dead ends: 160 [2022-11-20 20:55:20,722 INFO L226 Difference]: Without dead ends: 160 [2022-11-20 20:55:20,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=104, Invalid=303, Unknown=9, NotChecked=396, Total=812 [2022-11-20 20:55:20,723 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 79 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 869 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:20,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 857 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 403 Invalid, 0 Unknown, 869 Unchecked, 1.9s Time] [2022-11-20 20:55:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-20 20:55:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2022-11-20 20:55:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-11-20 20:55:20,727 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2022-11-20 20:55:20,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:20,727 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-11-20 20:55:20,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-11-20 20:55:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:55:20,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:20,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:20,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:20,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (17)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:21,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:21,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt [2022-11-20 20:55:21,335 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:55:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2022-11-20 20:55:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:55:21,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436648796] [2022-11-20 20:55:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:55:21,338 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:55:21,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (20)] Waiting until timeout for monitored process [2022-11-20 20:55:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:21,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:55:21,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:21,485 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 6 treesize of output 7 [2022-11-20 20:55:21,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:21,640 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 19 treesize of output 11 [2022-11-20 20:55:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:21,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:55:21,655 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:55:21,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436648796] [2022-11-20 20:55:21,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436648796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:55:21,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:55:21,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:55:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256744224] [2022-11-20 20:55:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:55:21,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:55:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:55:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:55:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:55:21,657 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:22,171 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-11-20 20:55:22,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:55:22,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 20:55:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:22,173 INFO L225 Difference]: With dead ends: 146 [2022-11-20 20:55:22,173 INFO L226 Difference]: Without dead ends: 146 [2022-11-20 20:55:22,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:55:22,174 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:22,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 160 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 20:55:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-20 20:55:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2022-11-20 20:55:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-20 20:55:22,178 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2022-11-20 20:55:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:22,178 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-20 20:55:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-20 20:55:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 20:55:22,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:22,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:22,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (20)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:22,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:22,387 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:55:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2022-11-20 20:55:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:55:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074169760] [2022-11-20 20:55:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:22,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:22,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:55:22,392 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:55:22,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-20 20:55:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:22,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 20:55:22,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:22,507 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 6 treesize of output 5 [2022-11-20 20:55:22,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:22,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:22,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:55:22,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-20 20:55:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:22,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:55:22,811 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:55:22,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074169760] [2022-11-20 20:55:22,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074169760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:55:22,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:55:22,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:55:22,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101419304] [2022-11-20 20:55:22,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:55:22,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:55:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:55:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:55:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:55:22,812 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:23,434 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-11-20 20:55:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:55:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 20:55:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:23,436 INFO L225 Difference]: With dead ends: 203 [2022-11-20 20:55:23,436 INFO L226 Difference]: Without dead ends: 203 [2022-11-20 20:55:23,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:55:23,437 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 165 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:23,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 187 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 20:55:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-20 20:55:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2022-11-20 20:55:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-11-20 20:55:23,441 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2022-11-20 20:55:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:23,441 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-11-20 20:55:23,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-11-20 20:55:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:55:23,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:23,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:23,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:23,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:23,643 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:55:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2022-11-20 20:55:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:55:23,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257291651] [2022-11-20 20:55:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:55:23,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:23,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:55:23,645 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:55:23,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-20 20:55:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:55:23,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 20:55:23,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:23,766 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 6 treesize of output 7 [2022-11-20 20:55:23,790 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:55:23,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:55:23,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:23,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:55:24,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 20:55:24,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 20:55:24,281 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 20:55:24,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-11-20 20:55:24,289 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-20 20:55:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:24,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:55:24,360 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:55:24,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257291651] [2022-11-20 20:55:24,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257291651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:55:24,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:55:24,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 20:55:24,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900689609] [2022-11-20 20:55:24,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:55:24,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:55:24,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:55:24,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:55:24,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:55:24,362 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:55:25,858 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2022-11-20 20:55:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:55:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 20:55:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:55:25,859 INFO L225 Difference]: With dead ends: 187 [2022-11-20 20:55:25,859 INFO L226 Difference]: Without dead ends: 187 [2022-11-20 20:55:25,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-11-20 20:55:25,860 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 203 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:55:25,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 544 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 390 Invalid, 0 Unknown, 64 Unchecked, 1.0s Time] [2022-11-20 20:55:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-20 20:55:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 128. [2022-11-20 20:55:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:25,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-11-20 20:55:25,865 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2022-11-20 20:55:25,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:55:25,865 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-11-20 20:55:25,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:55:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-11-20 20:55:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 20:55:25,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:55:25,867 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:55:25,877 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-20 20:55:26,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:26,071 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:55:26,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:55:26,071 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2022-11-20 20:55:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:55:26,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813654795] [2022-11-20 20:55:26,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 20:55:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:55:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:55:26,074 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:55:26,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (23)] Waiting until timeout for monitored process [2022-11-20 20:55:26,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 20:55:26,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:55:26,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 20:55:26,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:55:26,303 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 6 treesize of output 7 [2022-11-20 20:55:26,332 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:55:26,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:55:26,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:55:26,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:26,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:55:26,578 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:26,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:55:26,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-20 20:55:26,810 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 68 treesize of output 64 [2022-11-20 20:55:26,842 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:55:26,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-20 20:55:26,966 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 31 treesize of output 13 [2022-11-20 20:55:26,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-20 20:55:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:55:27,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:55:27,453 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse1 (bvadd (_ bv4 32) .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (not (bvule (bvadd .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse1)) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse3 .cse0) (bvadd (_ bv8 32) .cse3 .cse0))))))))) is different from false [2022-11-20 20:55:29,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_610))) (let ((.cse7 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (bvadd (_ bv8 32) .cse0 .cse7))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_611))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store .cse1 .cse2 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (not (bvule .cse5 (select |c_#length| .cse2))))))) (not (bvule (bvadd (_ bv4 32) .cse0 .cse7) .cse5))))))) (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_610))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse11 (bvadd (_ bv8 32) .cse0 .cse12))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_611) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store .cse9 .cse10 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse8) (bvadd .cse0 .cse8 (_ bv12 32))))) (not (bvule .cse11 (select |c_#length| .cse10)))))) (not (bvule (bvadd (_ bv4 32) .cse0 .cse12) .cse11)))))))))) is different from false [2022-11-20 20:55:29,276 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_610))) (let ((.cse6 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse0 (bvadd (_ bv8 32) .cse6))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_611) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store .cse3 .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) (not (bvule (bvadd (_ bv4 32) .cse6) .cse0))))))) (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_610))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (bvadd (_ bv8 32) .cse11))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_611))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule .cse7 (select |c_#length| .cse8))) (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse9 .cse8 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (not (bvule (bvadd (_ bv4 32) .cse11) .cse7)))))))))) is different from false [2022-11-20 20:55:29,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:29,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 142 [2022-11-20 20:55:29,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:29,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2022-11-20 20:55:29,406 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 156 treesize of output 132 [2022-11-20 20:55:29,414 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 310 treesize of output 256 [2022-11-20 20:55:29,439 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 181 treesize of output 157 [2022-11-20 20:55:29,458 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 191 treesize of output 167 [2022-11-20 20:55:29,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 92 [2022-11-20 20:55:29,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:29,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 152 [2022-11-20 20:55:29,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:55:29,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 86 [2022-11-20 20:55:29,857 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 454 treesize of output 382 [2022-11-20 20:55:29,885 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 1248 treesize of output 1146 [2022-11-20 20:55:29,930 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 1030 treesize of output 950 [2022-11-20 20:55:29,974 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 950 treesize of output 870 [2022-11-20 20:55:29,995 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 982 treesize of output 934 [2022-11-20 20:55:30,028 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 908 treesize of output 748 [2022-11-20 20:56:22,616 WARN L233 SmtUtils]: Spent 40.09s on a formula simplification. DAG size of input: 113 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:56:22,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:22,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 152 [2022-11-20 20:56:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 20:56:22,749 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:56:22,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813654795] [2022-11-20 20:56:22,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813654795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:22,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [3328045] [2022-11-20 20:56:22,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 20:56:22,750 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:56:22,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:56:22,759 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:56:22,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-20 20:56:23,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 20:56:23,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:56:23,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 20:56:23,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:23,168 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 6 treesize of output 7 [2022-11-20 20:56:23,190 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:56:23,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:56:23,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:56:23,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:56:23,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:56:23,326 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:56:23,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:56:23,337 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 22 treesize of output 24 [2022-11-20 20:56:23,562 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:56:23,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:56:23,571 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 22 treesize of output 24 [2022-11-20 20:56:23,660 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 31 treesize of output 13 [2022-11-20 20:56:23,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-20 20:56:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:23,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:23,831 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2022-11-20 20:56:23,894 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse3) (bvadd (_ bv8 32) .cse0 .cse3))))))) is different from false [2022-11-20 20:56:23,966 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse3) (bvadd .cse0 .cse3 (_ bv12 32)))))))) is different from false [2022-11-20 20:56:24,120 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_670))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_671) .cse0 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_671) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-20 20:56:24,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_670))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_671) .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_671) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32) .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-20 20:56:24,303 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_671) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_670))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_671) .cse3 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2022-11-20 20:56:24,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:24,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-20 20:56:24,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:24,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-20 20:56:24,356 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 400 treesize of output 334 [2022-11-20 20:56:24,376 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 688 treesize of output 634 [2022-11-20 20:56:24,388 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 630 treesize of output 582 [2022-11-20 20:56:24,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 582 treesize of output 534 [2022-11-20 20:56:24,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 430 [2022-11-20 20:56:24,411 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 430 treesize of output 414 [2022-11-20 20:56:27,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:27,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-20 20:56:27,138 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:27,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-20 20:56:27,150 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 102 treesize of output 84 [2022-11-20 20:56:27,160 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 174 treesize of output 144 [2022-11-20 20:56:27,184 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 102 treesize of output 86 [2022-11-20 20:56:27,191 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 124 treesize of output 100 [2022-11-20 20:56:27,207 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 70 treesize of output 62 [2022-11-20 20:56:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-20 20:56:27,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [3328045] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:27,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412955446] [2022-11-20 20:56:27,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 20:56:27,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:27,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:56:27,466 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:56:27,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 20:56:27,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 20:56:27,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:56:27,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 20:56:27,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:27,699 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 6 treesize of output 7 [2022-11-20 20:56:27,724 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 6 treesize of output 5 [2022-11-20 20:56:27,742 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:56:27,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:56:27,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:56:27,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:56:27,872 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:56:27,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:56:27,880 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 22 treesize of output 24 [2022-11-20 20:56:28,004 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:56:28,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-20 20:56:28,019 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 22 treesize of output 24 [2022-11-20 20:56:28,088 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 31 treesize of output 13 [2022-11-20 20:56:28,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 [2022-11-20 20:56:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:28,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:56:28,240 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-20 20:56:28,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2022-11-20 20:56:28,364 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-20 20:56:28,585 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_731) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_731))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_730) .cse3 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) is different from false [2022-11-20 20:56:28,979 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_731) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_731))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_730) .cse4 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2022-11-20 20:56:29,061 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_731) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_731))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_730) .cse3 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2022-11-20 20:56:29,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:29,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-20 20:56:29,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:29,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-20 20:56:29,114 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 754 treesize of output 640 [2022-11-20 20:56:29,125 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 1360 treesize of output 1258 [2022-11-20 20:56:29,153 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 1254 treesize of output 1158 [2022-11-20 20:56:29,163 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 1158 treesize of output 1062 [2022-11-20 20:56:29,173 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 1062 treesize of output 862 [2022-11-20 20:56:29,183 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 862 treesize of output 830 [2022-11-20 20:56:41,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:41,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-20 20:56:41,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:41,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-20 20:56:41,958 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 102 treesize of output 84 [2022-11-20 20:56:41,968 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 286 treesize of output 244 [2022-11-20 20:56:41,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2022-11-20 20:56:41,998 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 224 treesize of output 184 [2022-11-20 20:56:42,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 130 [2022-11-20 20:56:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-20 20:56:43,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412955446] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:56:43,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:56:43,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10, 12, 10, 12] total 34 [2022-11-20 20:56:43,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324325539] [2022-11-20 20:56:43,150 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:56:43,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:56:43,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:56:43,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:56:43,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=313, Unknown=18, NotChecked=750, Total=1190 [2022-11-20 20:56:43,152 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:53,139 INFO L93 Difference]: Finished difference Result 176 states and 188 transitions. [2022-11-20 20:56:53,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 20:56:53,140 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 20:56:53,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:53,141 INFO L225 Difference]: With dead ends: 176 [2022-11-20 20:56:53,141 INFO L226 Difference]: Without dead ends: 176 [2022-11-20 20:56:53,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=220, Invalid=751, Unknown=19, NotChecked=1080, Total=2070 [2022-11-20 20:56:53,143 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 100 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1739 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:53,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1287 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 478 Invalid, 0 Unknown, 1739 Unchecked, 3.0s Time] [2022-11-20 20:56:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-20 20:56:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 138. [2022-11-20 20:56:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2022-11-20 20:56:53,147 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 23 [2022-11-20 20:56:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:53,147 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2022-11-20 20:56:53,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2022-11-20 20:56:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 20:56:53,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:53,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:53,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2022-11-20 20:56:53,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (23)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:53,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-20 20:56:53,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:56:53,756 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:56:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash -543267076, now seen corresponding path program 1 times [2022-11-20 20:56:53,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:56:53,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [58000509] [2022-11-20 20:56:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:53,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:56:53,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:56:53,758 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:56:53,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (26)] Waiting until timeout for monitored process [2022-11-20 20:56:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:53,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-20 20:56:53,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:54,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:56:54,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:56:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:54,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:56:54,156 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:56:54,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [58000509] [2022-11-20 20:56:54,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [58000509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:54,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:54,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:56:54,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303972043] [2022-11-20 20:56:54,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:54,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:56:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:56:54,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:56:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:56:54,159 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:54,597 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2022-11-20 20:56:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:56:54,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-20 20:56:54,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:54,599 INFO L225 Difference]: With dead ends: 172 [2022-11-20 20:56:54,599 INFO L226 Difference]: Without dead ends: 172 [2022-11-20 20:56:54,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:56:54,600 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 156 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:54,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 169 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:56:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-20 20:56:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2022-11-20 20:56:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2022-11-20 20:56:54,605 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 25 [2022-11-20 20:56:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:54,605 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2022-11-20 20:56:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2022-11-20 20:56:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-20 20:56:54,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:54,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:54,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (26)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:54,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:56:54,818 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:56:54,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:54,819 INFO L85 PathProgramCache]: Analyzing trace with hash 338589996, now seen corresponding path program 1 times [2022-11-20 20:56:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:56:54,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74012362] [2022-11-20 20:56:54,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:54,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:56:54,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:56:54,821 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:56:54,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (27)] Waiting until timeout for monitored process [2022-11-20 20:56:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:54,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 20:56:54,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:55,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:56:55,413 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 23 treesize of output 11 [2022-11-20 20:56:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:55,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:56:55,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:56:55,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74012362] [2022-11-20 20:56:55,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74012362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:55,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:55,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:56:55,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009376164] [2022-11-20 20:56:55,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:55,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:56:55,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:56:55,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:56:55,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:56:55,494 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:56,270 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2022-11-20 20:56:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:56:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-20 20:56:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:56,271 INFO L225 Difference]: With dead ends: 173 [2022-11-20 20:56:56,271 INFO L226 Difference]: Without dead ends: 173 [2022-11-20 20:56:56,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-20 20:56:56,272 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 240 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:56,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 144 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 20:56:56,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-20 20:56:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 151. [2022-11-20 20:56:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 150 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2022-11-20 20:56:56,277 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 26 [2022-11-20 20:56:56,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:56,277 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2022-11-20 20:56:56,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:56,277 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2022-11-20 20:56:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:56:56,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:56,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:56,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (27)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:56,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:56:56,490 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:56:56,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1906355454, now seen corresponding path program 1 times [2022-11-20 20:56:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:56:56,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072187479] [2022-11-20 20:56:56,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:56,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:56:56,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:56:56,492 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:56:56,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (28)] Waiting until timeout for monitored process [2022-11-20 20:56:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:56,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:56:56,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:56,619 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 6 treesize of output 7 [2022-11-20 20:56:56,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:56:56,871 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 19 treesize of output 11 [2022-11-20 20:56:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:56,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:56:56,903 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:56:56,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072187479] [2022-11-20 20:56:56,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072187479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:56,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:56,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:56:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530972758] [2022-11-20 20:56:56,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:56,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:56:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:56:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:56:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:56:56,905 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:56:57,635 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2022-11-20 20:56:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:56:57,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 20:56:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:56:57,636 INFO L225 Difference]: With dead ends: 172 [2022-11-20 20:56:57,636 INFO L226 Difference]: Without dead ends: 172 [2022-11-20 20:56:57,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:56:57,637 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:56:57,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 164 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 20:56:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-20 20:56:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 154. [2022-11-20 20:56:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 127 states have (on average 1.4173228346456692) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2022-11-20 20:56:57,641 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 27 [2022-11-20 20:56:57,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:56:57,641 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2022-11-20 20:56:57,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:56:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2022-11-20 20:56:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:56:57,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:56:57,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:56:57,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (28)] Forceful destruction successful, exit code 0 [2022-11-20 20:56:57,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:56:57,843 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:56:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:56:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823547, now seen corresponding path program 1 times [2022-11-20 20:56:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:56:57,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901032209] [2022-11-20 20:56:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:56:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:56:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:56:57,845 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:56:57,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (29)] Waiting until timeout for monitored process [2022-11-20 20:56:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:56:58,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-20 20:56:58,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:56:58,162 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 6 treesize of output 7 [2022-11-20 20:56:58,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:56:58,694 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:56:58,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-20 20:56:58,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:56:58,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:56:59,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:56:59,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-11-20 20:56:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:56:59,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:56:59,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:56:59,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901032209] [2022-11-20 20:56:59,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901032209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:56:59,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:56:59,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 20:56:59,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865349976] [2022-11-20 20:56:59,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:56:59,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:56:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:56:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:56:59,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:56:59,195 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:01,831 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2022-11-20 20:57:01,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:57:01,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 20:57:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:01,832 INFO L225 Difference]: With dead ends: 185 [2022-11-20 20:57:01,832 INFO L226 Difference]: Without dead ends: 185 [2022-11-20 20:57:01,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-11-20 20:57:01,833 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 291 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:01,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 388 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 470 Invalid, 0 Unknown, 78 Unchecked, 1.7s Time] [2022-11-20 20:57:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-20 20:57:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2022-11-20 20:57:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 133 states have (on average 1.406015037593985) internal successors, (187), 158 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 187 transitions. [2022-11-20 20:57:01,837 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 187 transitions. Word has length 27 [2022-11-20 20:57:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:01,838 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 187 transitions. [2022-11-20 20:57:01,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 187 transitions. [2022-11-20 20:57:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-20 20:57:01,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:01,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:01,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (29)] Ended with exit code 0 [2022-11-20 20:57:02,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:02,047 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:02,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823546, now seen corresponding path program 1 times [2022-11-20 20:57:02,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:02,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38650917] [2022-11-20 20:57:02,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:02,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:02,048 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:02,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (30)] Waiting until timeout for monitored process [2022-11-20 20:57:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:02,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-20 20:57:02,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:02,270 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 6 treesize of output 7 [2022-11-20 20:57:02,318 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:57:02,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:57:02,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:57:02,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:02,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:02,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-20 20:57:02,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-20 20:57:03,261 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-20 20:57:03,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2022-11-20 20:57:03,274 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-20 20:57:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:03,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:03,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:03,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38650917] [2022-11-20 20:57:03,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38650917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:03,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:03,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 20:57:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603852131] [2022-11-20 20:57:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:03,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:57:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:57:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:57:03,414 INFO L87 Difference]: Start difference. First operand 159 states and 187 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:07,266 INFO L93 Difference]: Finished difference Result 221 states and 248 transitions. [2022-11-20 20:57:07,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:57:07,267 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-20 20:57:07,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:07,269 INFO L225 Difference]: With dead ends: 221 [2022-11-20 20:57:07,269 INFO L226 Difference]: Without dead ends: 221 [2022-11-20 20:57:07,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-11-20 20:57:07,270 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 308 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:07,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 377 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 623 Invalid, 0 Unknown, 87 Unchecked, 2.5s Time] [2022-11-20 20:57:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-20 20:57:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 169. [2022-11-20 20:57:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 143 states have (on average 1.4125874125874125) internal successors, (202), 168 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2022-11-20 20:57:07,275 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 27 [2022-11-20 20:57:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:07,276 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2022-11-20 20:57:07,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2022-11-20 20:57:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 20:57:07,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:07,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:07,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (30)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:07,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:07,490 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:07,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522897, now seen corresponding path program 1 times [2022-11-20 20:57:07,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:07,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316258413] [2022-11-20 20:57:07,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:07,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:07,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:07,492 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:07,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (31)] Waiting until timeout for monitored process [2022-11-20 20:57:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:07,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-20 20:57:07,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:08,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:08,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:08,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:57:08,687 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:57:08,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2022-11-20 20:57:08,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 20 [2022-11-20 20:57:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:08,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:08,826 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316258413] [2022-11-20 20:57:08,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316258413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:08,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:08,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 20:57:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984356371] [2022-11-20 20:57:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:08,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:57:08,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:57:08,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:57:08,828 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:11,547 INFO L93 Difference]: Finished difference Result 193 states and 216 transitions. [2022-11-20 20:57:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:57:11,548 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-20 20:57:11,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:11,549 INFO L225 Difference]: With dead ends: 193 [2022-11-20 20:57:11,549 INFO L226 Difference]: Without dead ends: 193 [2022-11-20 20:57:11,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-11-20 20:57:11,550 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 387 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:11,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 293 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-20 20:57:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-20 20:57:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 170. [2022-11-20 20:57:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 169 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 204 transitions. [2022-11-20 20:57:11,555 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 204 transitions. Word has length 28 [2022-11-20 20:57:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:11,555 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 204 transitions. [2022-11-20 20:57:11,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 204 transitions. [2022-11-20 20:57:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-20 20:57:11,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:11,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:11,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (31)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:11,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:11,768 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:11,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522896, now seen corresponding path program 1 times [2022-11-20 20:57:11,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:11,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789686443] [2022-11-20 20:57:11,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:11,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:11,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:11,770 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:11,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (32)] Waiting until timeout for monitored process [2022-11-20 20:57:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:11,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 20:57:11,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:12,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:12,157 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:12,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789686443] [2022-11-20 20:57:12,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789686443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:12,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:12,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:57:12,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925342884] [2022-11-20 20:57:12,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:12,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:57:12,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:12,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:57:12,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:57:12,159 INFO L87 Difference]: Start difference. First operand 170 states and 204 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:12,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:12,422 INFO L93 Difference]: Finished difference Result 165 states and 196 transitions. [2022-11-20 20:57:12,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 20:57:12,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-20 20:57:12,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:12,425 INFO L225 Difference]: With dead ends: 165 [2022-11-20 20:57:12,425 INFO L226 Difference]: Without dead ends: 165 [2022-11-20 20:57:12,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:57:12,426 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:12,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 50 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 20:57:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-20 20:57:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-20 20:57:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 144 states have (on average 1.3611111111111112) internal successors, (196), 164 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 196 transitions. [2022-11-20 20:57:12,432 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 196 transitions. Word has length 28 [2022-11-20 20:57:12,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:12,432 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 196 transitions. [2022-11-20 20:57:12,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:12,432 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 196 transitions. [2022-11-20 20:57:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 20:57:12,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:12,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:12,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (32)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:12,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:12,645 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:12,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1614814932, now seen corresponding path program 1 times [2022-11-20 20:57:12,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:12,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383670742] [2022-11-20 20:57:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:12,647 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:12,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (33)] Waiting until timeout for monitored process [2022-11-20 20:57:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:12,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:57:12,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:12,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:13,177 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:13,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383670742] [2022-11-20 20:57:13,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383670742] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:13,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [485485609] [2022-11-20 20:57:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:13,178 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:57:13,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:57:13,179 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:57:13,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-20 20:57:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:13,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:57:13,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:13,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:13,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:13,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [485485609] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:13,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584053622] [2022-11-20 20:57:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:13,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:13,641 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:13,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-20 20:57:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:13,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 20:57:13,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:13,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:14,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584053622] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:14,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:57:14,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 7] total 13 [2022-11-20 20:57:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625280305] [2022-11-20 20:57:14,296 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:14,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 20:57:14,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 20:57:14,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-20 20:57:14,298 INFO L87 Difference]: Start difference. First operand 165 states and 196 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:15,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:15,033 INFO L93 Difference]: Finished difference Result 254 states and 292 transitions. [2022-11-20 20:57:15,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 20:57:15,034 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 20:57:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:15,035 INFO L225 Difference]: With dead ends: 254 [2022-11-20 20:57:15,035 INFO L226 Difference]: Without dead ends: 254 [2022-11-20 20:57:15,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:57:15,036 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 249 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:15,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 808 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:57:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-20 20:57:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 183. [2022-11-20 20:57:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3333333333333333) internal successors, (216), 182 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 216 transitions. [2022-11-20 20:57:15,042 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 216 transitions. Word has length 30 [2022-11-20 20:57:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:15,042 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 216 transitions. [2022-11-20 20:57:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 216 transitions. [2022-11-20 20:57:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 20:57:15,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:15,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:15,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (33)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:15,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:15,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-11-20 20:57:15,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:15,656 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash -842646633, now seen corresponding path program 1 times [2022-11-20 20:57:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:15,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963978397] [2022-11-20 20:57:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:15,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:15,658 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:15,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (36)] Waiting until timeout for monitored process [2022-11-20 20:57:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:15,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 20:57:15,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:15,879 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 6 treesize of output 7 [2022-11-20 20:57:15,928 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:57:15,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:57:16,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:16,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-20 20:57:16,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:16,693 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 23 treesize of output 15 [2022-11-20 20:57:16,789 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 20:57:16,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-11-20 20:57:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:16,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:16,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:16,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963978397] [2022-11-20 20:57:16,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963978397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:16,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:16,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 20:57:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990609940] [2022-11-20 20:57:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:16,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:57:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:16,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:57:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:57:16,939 INFO L87 Difference]: Start difference. First operand 183 states and 216 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:20,482 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-11-20 20:57:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:57:20,484 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 20:57:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:20,486 INFO L225 Difference]: With dead ends: 228 [2022-11-20 20:57:20,486 INFO L226 Difference]: Without dead ends: 228 [2022-11-20 20:57:20,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-11-20 20:57:20,486 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 307 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:20,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 411 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 524 Invalid, 0 Unknown, 78 Unchecked, 2.2s Time] [2022-11-20 20:57:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-20 20:57:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 183. [2022-11-20 20:57:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 182 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 214 transitions. [2022-11-20 20:57:20,492 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 214 transitions. Word has length 30 [2022-11-20 20:57:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:20,492 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 214 transitions. [2022-11-20 20:57:20,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 214 transitions. [2022-11-20 20:57:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-20 20:57:20,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:20,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:20,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (36)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:20,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:20,706 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash -842657618, now seen corresponding path program 1 times [2022-11-20 20:57:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:20,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734138195] [2022-11-20 20:57:20,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:20,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:20,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:20,710 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:20,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (37)] Waiting until timeout for monitored process [2022-11-20 20:57:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:20,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 20:57:20,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:20,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-20 20:57:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:20,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:20,945 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:20,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734138195] [2022-11-20 20:57:20,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734138195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:20,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:20,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:57:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083434358] [2022-11-20 20:57:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:57:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:57:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:57:20,946 INFO L87 Difference]: Start difference. First operand 183 states and 214 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:21,357 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2022-11-20 20:57:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:57:21,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-20 20:57:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:21,360 INFO L225 Difference]: With dead ends: 199 [2022-11-20 20:57:21,361 INFO L226 Difference]: Without dead ends: 199 [2022-11-20 20:57:21,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:57:21,361 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:21,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 242 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:57:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-20 20:57:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2022-11-20 20:57:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 181 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 211 transitions. [2022-11-20 20:57:21,366 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 211 transitions. Word has length 30 [2022-11-20 20:57:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:21,366 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 211 transitions. [2022-11-20 20:57:21,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2022-11-20 20:57:21,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-20 20:57:21,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:21,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:21,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (37)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:21,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:21,580 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash -352582234, now seen corresponding path program 1 times [2022-11-20 20:57:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:21,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684420603] [2022-11-20 20:57:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:21,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:21,582 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:21,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (38)] Waiting until timeout for monitored process [2022-11-20 20:57:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:21,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 20:57:21,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:21,977 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 19 treesize of output 7 [2022-11-20 20:57:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:22,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 20:57:22,040 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:22,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684420603] [2022-11-20 20:57:22,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684420603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:57:22,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:57:22,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:57:22,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111684343] [2022-11-20 20:57:22,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:57:22,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:57:22,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:57:22,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 20:57:22,041 INFO L87 Difference]: Start difference. First operand 182 states and 211 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:22,628 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2022-11-20 20:57:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:57:22,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-20 20:57:22,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:22,630 INFO L225 Difference]: With dead ends: 197 [2022-11-20 20:57:22,630 INFO L226 Difference]: Without dead ends: 197 [2022-11-20 20:57:22,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:57:22,631 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:22,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 20:57:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-20 20:57:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2022-11-20 20:57:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 162 states have (on average 1.2654320987654322) internal successors, (205), 179 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 205 transitions. [2022-11-20 20:57:22,636 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 205 transitions. Word has length 31 [2022-11-20 20:57:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:22,636 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 205 transitions. [2022-11-20 20:57:22,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 205 transitions. [2022-11-20 20:57:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 20:57:22,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:22,637 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:57:22,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (38)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:22,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:22,850 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash -822688907, now seen corresponding path program 1 times [2022-11-20 20:57:22,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:22,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146706223] [2022-11-20 20:57:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:22,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:22,852 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:22,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (39)] Waiting until timeout for monitored process [2022-11-20 20:57:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:23,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 20:57:23,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:23,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:23,682 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 33 treesize of output 21 [2022-11-20 20:57:30,728 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ BitVec 32)) (v_ArrVal_1377 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_21| v_ArrVal_1377))) (and (= (store (store .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_21| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_21|))))) is different from true [2022-11-20 20:57:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:30,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:33,107 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 52 treesize of output 48 [2022-11-20 20:57:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:35,863 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:57:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146706223] [2022-11-20 20:57:35,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146706223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [47247182] [2022-11-20 20:57:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:35,863 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:57:35,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:57:35,864 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:57:35,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-20 20:57:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:36,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-20 20:57:36,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:37,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:37,861 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 40 treesize of output 24 [2022-11-20 20:57:38,481 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~mem21#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#list~0#1.base_23| (_ BitVec 32)) (v_ArrVal_1413 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_23| v_ArrVal_1413))) (and (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_12| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_23| (_ bv0 1))) (bvult |v_ULTIMATE.start_main_#t~mem21#1.base_12| |#StackHeapBarrier|) (= (select .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_12|) (_ bv0 1)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_23|)) (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#list~0#1.base_23|)))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)))) is different from true [2022-11-20 20:57:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:38,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:38,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-11-20 20:57:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:39,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [47247182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:39,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836476463] [2022-11-20 20:57:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:39,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:39,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:57:39,192 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:57:39,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-20 20:57:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:39,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 20:57:39,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:39,425 INFO L321 Elim1Store]: treesize reduction 15, result has 31.8 percent of original size [2022-11-20 20:57:39,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 36 [2022-11-20 20:57:39,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-20 20:57:40,244 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 32 treesize of output 20 [2022-11-20 20:57:40,439 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:57:40,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 39 [2022-11-20 20:57:42,799 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#list~0#1.base_25| (_ BitVec 32)) (v_ArrVal_1377 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_25| v_ArrVal_1377))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_25|)) (= (store (store .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_25| (_ bv0 1)) |c_#valid|) (= (select .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9|) (_ bv0 1))))) is different from true [2022-11-20 20:57:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:42,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:57:43,180 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 90 treesize of output 82 [2022-11-20 20:57:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:46,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836476463] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:57:46,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:57:46,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 9] total 29 [2022-11-20 20:57:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213173755] [2022-11-20 20:57:46,209 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:57:46,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 20:57:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:57:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 20:57:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=590, Unknown=9, NotChecked=156, Total=870 [2022-11-20 20:57:46,211 INFO L87 Difference]: Start difference. First operand 180 states and 205 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 30 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:57:49,676 INFO L93 Difference]: Finished difference Result 212 states and 239 transitions. [2022-11-20 20:57:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 20:57:49,677 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 30 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 20:57:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:57:49,679 INFO L225 Difference]: With dead ends: 212 [2022-11-20 20:57:49,679 INFO L226 Difference]: Without dead ends: 210 [2022-11-20 20:57:49,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=154, Invalid=841, Unknown=9, NotChecked=186, Total=1190 [2022-11-20 20:57:49,680 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 314 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:57:49,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 553 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 314 Unchecked, 0.6s Time] [2022-11-20 20:57:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-20 20:57:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2022-11-20 20:57:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.236842105263158) internal successors, (235), 207 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 235 transitions. [2022-11-20 20:57:49,691 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 235 transitions. Word has length 32 [2022-11-20 20:57:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:57:49,692 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 235 transitions. [2022-11-20 20:57:49,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 30 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:57:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 235 transitions. [2022-11-20 20:57:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 20:57:49,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:57:49,694 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, 1, 1, 1, 1] [2022-11-20 20:57:49,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (39)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:49,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-20 20:57:50,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-11-20 20:57:50,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:57:50,306 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:57:50,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:57:50,307 INFO L85 PathProgramCache]: Analyzing trace with hash -822688903, now seen corresponding path program 1 times [2022-11-20 20:57:50,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:57:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237887545] [2022-11-20 20:57:50,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:57:50,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:57:50,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:57:50,309 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:57:50,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (42)] Waiting until timeout for monitored process [2022-11-20 20:57:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:57:50,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-20 20:57:50,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:57:50,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:50,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 20:57:50,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:50,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 20:57:51,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:51,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:57:51,138 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:57:51,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2022-11-20 20:57:51,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:51,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:57:51,228 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:57:51,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2022-11-20 20:57:51,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:57:51,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-20 20:57:51,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:57:51,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-20 20:57:53,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:57:53,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:57:53,261 INFO L321 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-11-20 20:57:53,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 84 [2022-11-20 20:57:53,276 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:57:53,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 53 [2022-11-20 20:57:53,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-20 20:57:53,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-20 20:57:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:57:53,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:15,537 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-20 20:58:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237887545] [2022-11-20 20:58:15,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237887545] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:15,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [633068560] [2022-11-20 20:58:15,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:15,538 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-20 20:58:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 [2022-11-20 20:58:15,539 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-20 20:58:15,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-20 20:58:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:15,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-20 20:58:15,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:16,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:16,890 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 20:58:16,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:16,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 20:58:17,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:17,500 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:58:17,500 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 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 20:58:17,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:17,583 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:58:17,584 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 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 20:58:18,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:18,147 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 26 treesize of output 21 [2022-11-20 20:58:18,239 INFO L321 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-20 20:58:18,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 45 [2022-11-20 20:58:18,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 20:58:18,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 20:58:22,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:22,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:22,487 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-20 20:58:22,487 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 65 [2022-11-20 20:58:22,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:22,510 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:58:22,510 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-11-20 20:58:23,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:23,193 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 26 treesize of output 10 [2022-11-20 20:58:23,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:23,208 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 26 treesize of output 10 [2022-11-20 20:58:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:23,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:25,236 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse0 (_ bv0 32))) (= (select (select .cse1 .cse2) (bvadd (_ bv4 32) .cse0)) (_ bv0 32))))) (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse3 (_ bv0 32))) (= (select (select .cse4 .cse2) (bvadd (_ bv4 32) .cse3)) (_ bv0 32))))))))) is different from false [2022-11-20 20:58:25,403 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) (and (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse0 (_ bv0 32))) (= (select (select .cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse2 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse2 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) .cse0)) (_ bv0 32)))))) (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse5 (_ bv0 32))) (= (_ bv0 32) (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (bvadd (_ bv4 32) .cse5)))))))) is different from false [2022-11-20 20:58:25,871 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.base|)) (.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.offset|))) (and (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (_ bv0 32) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) .cse3))) (not (= .cse3 (_ bv0 32))))))) (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse6 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse6 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (bvadd (_ bv4 32) .cse7)) (_ bv0 32)) (not (= .cse7 (_ bv0 32))))))))) is different from false [2022-11-20 20:58:26,163 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|)))) (and (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (bvadd (_ bv4 32) .cse3)) (_ bv0 32)) (not (= .cse3 (_ bv0 32)))))) (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse5 (_ bv0 32))) (= (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) .cse5)) (_ bv0 32))))))))) is different from false [2022-11-20 20:58:26,242 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 56 treesize of output 52 [2022-11-20 20:58:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:28,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [633068560] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:28,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112750757] [2022-11-20 20:58:28,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:58:28,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:58:28,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:58:28,087 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:58:28,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-20 20:58:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:58:28,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-20 20:58:28,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:58:30,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:30,927 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 20:58:30,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:30,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-20 20:58:31,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:31,552 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:58:31,552 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 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 20:58:31,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:31,646 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-20 20:58:31,646 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 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 20:58:32,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:58:32,252 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 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-20 20:58:32,371 INFO L321 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-20 20:58:32,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 55 [2022-11-20 20:58:32,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-20 20:58:35,914 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-11-20 20:58:36,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:36,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:58:36,614 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-20 20:58:36,615 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 71 [2022-11-20 20:58:36,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:58:36,629 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 20:58:36,630 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2022-11-20 20:58:36,663 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:58:36,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:58:37,128 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 26 treesize of output 10 [2022-11-20 20:58:37,139 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 26 treesize of output 10 [2022-11-20 20:58:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:37,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:58:37,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-20 20:58:46,943 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (and (forall ((v_ArrVal_1577 (_ BitVec 32)) (|ULTIMATE.start_append_~node~0#1.base| (_ BitVec 32))) (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) .cse3 |c_ULTIMATE.start_append_#t~mem14#1.base|) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1577)))) (store .cse4 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse4 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((v_ArrVal_1578 (_ BitVec 32)) (v_ArrVal_1582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) .cse3 |c_ULTIMATE.start_append_#t~mem14#1.offset|) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1582) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (select .cse1 .cse0) (bvadd (_ bv4 32) .cse2)) (_ bv0 32)) (not (= .cse2 (_ bv0 32)))))))))) (forall ((v_ArrVal_1577 (_ BitVec 32)) (|ULTIMATE.start_append_~node~0#1.base| (_ BitVec 32))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) .cse3 |c_ULTIMATE.start_append_#t~mem14#1.base|) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1577)))) (store .cse8 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse8 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (forall ((v_ArrVal_1578 (_ BitVec 32)) (v_ArrVal_1582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) .cse3 |c_ULTIMATE.start_append_#t~mem14#1.offset|) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1582))) (let ((.cse7 (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (select .cse5 .cse6) (bvadd (_ bv4 32) .cse7)) (_ bv0 32)) (not (= .cse7 (_ bv0 32))))))) (= .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) is different from false [2022-11-20 20:58:49,053 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (and (forall ((v_ArrVal_1577 (_ BitVec 32)) (|ULTIMATE.start_append_~node~0#1.base| (_ BitVec 32))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse6) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1577)))) (store .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse5 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse0) (forall ((v_ArrVal_1578 (_ BitVec 32)) (v_ArrVal_1582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse4) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1582) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (select .cse1 .cse0) (bvadd (_ bv4 32) .cse2)) (_ bv0 32)) (not (= .cse2 (_ bv0 32)))))))))) (forall ((v_ArrVal_1577 (_ BitVec 32)) (|ULTIMATE.start_append_~node~0#1.base| (_ BitVec 32))) (let ((.cse7 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse6) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1577)))) (store .cse10 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse10 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse7) (forall ((v_ArrVal_1578 (_ BitVec 32)) (v_ArrVal_1582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_append_~node~0#1.base|) .cse3 .cse4) |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1578)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1582))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (select .cse8 .cse7) (bvadd (_ bv4 32) .cse9)) (_ bv0 32)) (not (= .cse9 (_ bv0 32)))))))))))) is different from false [2022-11-20 20:58:49,436 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 56 treesize of output 52 [2022-11-20 20:58:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:58:52,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112750757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:58:52,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-20 20:58:52,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15, 15, 16, 16] total 77 [2022-11-20 20:58:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955986635] [2022-11-20 20:58:52,744 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-20 20:58:52,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-20 20:58:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-20 20:58:52,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-20 20:58:52,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=4481, Unknown=33, NotChecked=858, Total=5852 [2022-11-20 20:58:52,747 INFO L87 Difference]: Start difference. First operand 208 states and 235 transitions. Second operand has 77 states, 77 states have (on average 2.155844155844156) internal successors, (166), 77 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:59:18,435 INFO L93 Difference]: Finished difference Result 212 states and 239 transitions. [2022-11-20 20:59:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 20:59:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.155844155844156) internal successors, (166), 77 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 20:59:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:59:18,437 INFO L225 Difference]: With dead ends: 212 [2022-11-20 20:59:18,437 INFO L226 Difference]: Without dead ends: 195 [2022-11-20 20:59:18,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2674 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=790, Invalid=6507, Unknown=37, NotChecked=1038, Total=8372 [2022-11-20 20:59:18,439 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 57 mSDsluCounter, 1642 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 274 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:59:18,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1696 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 274 Unchecked, 0.9s Time] [2022-11-20 20:59:18,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-20 20:59:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2022-11-20 20:59:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.254335260115607) internal successors, (217), 190 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2022-11-20 20:59:18,444 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 32 [2022-11-20 20:59:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:59:18,444 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2022-11-20 20:59:18,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.155844155844156) internal successors, (166), 77 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:59:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2022-11-20 20:59:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 20:59:18,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:59:18,446 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:59:18,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (42)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:18,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2022-11-20 20:59:18,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-20 20:59:19,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:59:19,058 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-20 20:59:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:59:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 840971577, now seen corresponding path program 3 times [2022-11-20 20:59:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-20 20:59:19,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356221106] [2022-11-20 20:59:19,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:59:19,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 20:59:19,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat [2022-11-20 20:59:19,060 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 20:59:19,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3fcc4677-2685-4cdf-9547-82ec355f8144/bin/utaipan-6cKwYrpEi9/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 (45)] Waiting until timeout for monitored process [2022-11-20 20:59:19,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-20 20:59:19,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:59:19,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-20 20:59:19,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:59:19,628 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 6 treesize of output 7 [2022-11-20 20:59:19,638 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 6 treesize of output 5 [2022-11-20 20:59:19,690 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 20:59:19,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-20 20:59:19,702 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 12 treesize of output 14 [2022-11-20 20:59:19,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:59:19,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:59:20,114 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:59:20,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 20:59:20,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:20,134 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 22 treesize of output 24 [2022-11-20 20:59:20,435 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:59:20,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 20:59:20,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:20,454 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 22 treesize of output 24 [2022-11-20 20:59:20,808 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:59:20,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-20 20:59:20,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:20,820 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 22 treesize of output 24 [2022-11-20 20:59:21,221 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:59:21,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-11-20 20:59:21,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:59:21,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-20 20:59:21,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-20 20:59:21,460 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 19 treesize of output 7 [2022-11-20 20:59:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:59:21,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:59:25,163 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1680))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse2 (bvadd (_ bv8 32) .cse0 .cse1))) (or (not (bvule (bvadd (_ bv4 32) .cse0 .cse1) .cse2)) (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store .cse5 .cse3 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse4 (_ bv8 32) .cse1) (bvadd .cse4 .cse1 (_ bv12 32))))))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1680))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse9 (bvadd (_ bv8 32) .cse8 .cse1))) (or (not (bvule (bvadd (_ bv4 32) .cse8 .cse1) .cse9)) (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1681))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (not (bvule .cse9 (select |c_#length| .cse10))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse11 .cse10 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse12 .cse10 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))))))))) is different from false [2022-11-20 20:59:25,435 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1680))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse2 (bvadd .cse0 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse0 .cse1) .cse2)) (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1681))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store .cse4 .cse3 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) .cse1) (select |c_#length| (select (select (store .cse6 .cse3 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1680))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse11 (bvadd .cse12 .cse1 (_ bv12 32)))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store .cse9 .cse10 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse8 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse8 .cse1)))) (not (bvule .cse11 (select |c_#length| .cse10)))))) (not (bvule (bvadd (_ bv8 32) .cse12 .cse1) .cse11)))))))))) is different from false [2022-11-20 20:59:25,724 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1679))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1678) .cse7 v_ArrVal_1680))) (let ((.cse8 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (bvadd .cse0 .cse8 (_ bv12 32)))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse6 .cse7 v_ArrVal_1681))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (not (bvule .cse5 (select |c_#length| .cse2))))))) (not (bvule (bvadd (_ bv8 32) .cse0 .cse8) .cse5))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1679))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1678) .cse14 v_ArrVal_1680))) (let ((.cse15 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse12 (bvadd .cse0 .cse15 (_ bv12 32)))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store .cse13 .cse14 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (store .cse10 .cse11 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse9 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse9)))) (not (bvule .cse12 (select |c_#length| .cse11)))))) (not (bvule (bvadd (_ bv8 32) .cse0 .cse15) .cse12))))))))))) is different from false [2022-11-20 20:59:25,939 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1679))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1678) .cse8 v_ArrVal_1680))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse2 (bvadd .cse0 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd .cse0 (_ bv8 32) .cse1) .cse2)) (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store .cse7 .cse8 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store .cse5 .cse3 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse4 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse1)))))))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1679))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1678) .cse16 v_ArrVal_1680))) (let ((.cse10 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse11 (bvadd .cse10 .cse1 (_ bv12 32)))) (or (not (bvule (bvadd .cse10 (_ bv8 32) .cse1) .cse11)) (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store .cse15 .cse16 v_ArrVal_1681))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store .cse12 .cse13 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) .cse1) (select |c_#length| (select (select (store .cse14 .cse13 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))) (not (bvule .cse11 (select |c_#length| .cse13))))))))))))))))) is different from false [2022-11-20 20:59:26,288 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1679))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1678) .cse7 v_ArrVal_1680))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse0 (bvadd .cse8 (_ bv16 32) .cse3))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store .cse6 .cse7 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store .cse4 .cse1 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv16 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv20 32)))))))) (not (bvule (bvadd .cse8 .cse3 (_ bv12 32)) .cse0))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1679))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse10 (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1678) .cse15 v_ArrVal_1680))) (let ((.cse16 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse13 (bvadd .cse16 (_ bv16 32) .cse3))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store .cse14 .cse15 v_ArrVal_1681))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse10 .cse11 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) .cse3 (_ bv20 32)) (select |c_#length| (select (select (store .cse12 .cse11 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))) (not (bvule .cse13 (select |c_#length| .cse11))))))) (not (bvule (bvadd .cse16 .cse3 (_ bv12 32)) .cse13)))))))))))) is different from false [2022-11-20 20:59:28,704 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1676))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse6 (store .cse10 .cse9 v_ArrVal_1679))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1677) .cse9 v_ArrVal_1678) .cse7 v_ArrVal_1680))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse0 (bvadd (_ bv16 32) .cse8 .cse3))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store .cse6 .cse7 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store .cse4 .cse1 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (_ bv16 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv20 32)))))))) (not (bvule (bvadd .cse8 .cse3 (_ bv12 32)) .cse0))))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1676))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse16 (store .cse19 .cse18 v_ArrVal_1679))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1677) .cse18 v_ArrVal_1678) .cse17 v_ArrVal_1680))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse12 (bvadd (_ bv16 32) .cse11 .cse3))) (or (not (bvule (bvadd .cse11 .cse3 (_ bv12 32)) .cse12)) (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store .cse16 .cse17 v_ArrVal_1681))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (not (bvule .cse12 (select |c_#length| .cse13))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse14 .cse13 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) .cse3 (_ bv20 32)) (select |c_#length| (select (select (store .cse15 .cse13 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))))))))))))))) is different from false [2022-11-20 20:59:30,966 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1676))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse7 (store .cse11 .cse10 v_ArrVal_1679))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1677) .cse10 v_ArrVal_1678) .cse8 v_ArrVal_1680))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse2 (bvadd (_ bv16 32) .cse0 .cse1))) (or (not (bvule (bvadd .cse0 .cse1 (_ bv12 32)) .cse2)) (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store .cse7 .cse8 v_ArrVal_1681))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse3 .cse4 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) .cse1 (_ bv20 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5)))) (not (bvule .cse2 (select |c_#length| .cse4)))))))))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1676))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse16 (store .cse20 .cse19 v_ArrVal_1679))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse13 (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_1677) .cse19 v_ArrVal_1678) .cse17 v_ArrVal_1680))) (let ((.cse18 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse15 (bvadd (_ bv16 32) .cse18 .cse1))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (select (store .cse16 .cse17 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (or (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse13 .cse14 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd .cse12 (_ bv16 32) .cse1) (bvadd .cse12 .cse1 (_ bv20 32))))) (not (bvule .cse15 (select |c_#length| .cse14)))))) (not (bvule (bvadd .cse18 .cse1 (_ bv12 32)) .cse15)))))))))))))) is different from false [2022-11-20 20:59:31,396 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1676))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (store .cse10 .cse9 v_ArrVal_1679))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1677) .cse9 v_ArrVal_1678) .cse6 v_ArrVal_1680))) (let ((.cse7 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse0 (bvadd (_ bv16 32) .cse7))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store .cse5 .cse6 v_ArrVal_1681))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1682 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse2 .cse1 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv20 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1682) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (not (bvule (bvadd .cse7 (_ bv12 32)) .cse0))))))))))) (forall ((v_ArrVal_1680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1679 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1676))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse15 (store .cse19 .cse18 v_ArrVal_1679))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1677) .cse18 v_ArrVal_1678) .cse16 v_ArrVal_1680))) (let ((.cse17 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse11 (bvadd (_ bv16 32) .cse17))) (or (forall ((v_ArrVal_1681 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (select (store .cse15 .cse16 v_ArrVal_1681) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (not (bvule .cse11 (select |c_#length| .cse12))) (forall ((v_ArrVal_1683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store .cse14 .cse12 v_ArrVal_1683) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse13 (_ bv16 32)) (bvadd .cse13 (_ bv20 32)))))))) (not (bvule (bvadd .cse17 (_ bv12 32)) .cse11)))))))))))))) is different from false [2022-11-20 20:59:31,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:31,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 710 treesize of output 670 [2022-11-20 20:59:31,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:59:31,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 660 treesize of output 400 [2022-11-20 20:59:31,540 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 37314 treesize of output 32052 [2022-11-20 20:59:31,805 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 586972 treesize of output 568390 [2022-11-20 20:59:35,559 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 561828 treesize of output 541668 [2022-11-20 20:59:37,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 452878 treesize of output 385966 [2022-11-20 20:59:39,508 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 481314 treesize of output 461426 [2022-11-20 20:59:41,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 461426 treesize of output 421250 [2022-11-20 20:59:43,203 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 421250 treesize of output 373954 [2022-11-20 20:59:45,044 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 373954 treesize of output 364162 [2022-11-20 20:59:46,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364162 treesize of output 349146 [2022-11-20 21:00:07,890 WARN L233 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 1111 DAG size of output: 1111 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 21:00:24,593 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 919 DAG size of output: 919 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 21:00:39,142 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 919 DAG size of output: 919 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 21:06:33,822 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 919 DAG size of output: 919 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 21:06:51,416 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 919 DAG size of output: 919 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 21:07:29,228 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 919 DAG size of output: 919 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 21:09:25,132 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 919 DAG size of output: 919 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)