./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 5e519f3a 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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI --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-5e519f3 [2022-11-03 04:00:19,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:00:19,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:00:19,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:00:19,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:00:19,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:00:19,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:00:19,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:00:19,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:00:19,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:00:19,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:00:19,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:00:19,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:00:19,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:00:19,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:00:19,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:00:19,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:00:19,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:00:19,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:00:19,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:00:19,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:00:19,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:00:19,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:00:19,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:00:19,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:00:19,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:00:19,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:00:19,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:00:19,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:00:19,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:00:19,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:00:19,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:00:19,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:00:19,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:00:19,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:00:19,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:00:19,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:00:19,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:00:19,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:00:19,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:00:19,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:00:19,976 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 04:00:20,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:00:20,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:00:20,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:00:20,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:00:20,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:00:20,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:00:20,023 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:00:20,023 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:00:20,023 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:00:20,023 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:00:20,024 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:00:20,025 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:00:20,025 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:00:20,025 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:00:20,025 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:00:20,026 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:00:20,026 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:00:20,026 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:00:20,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 04:00:20,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 04:00:20,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:00:20,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:00:20,028 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 04:00:20,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:00:20,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:00:20,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:00:20,028 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 04:00:20,029 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 04:00:20,029 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 04:00:20,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:00:20,030 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 04:00:20,030 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:00:20,030 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:00:20,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:00:20,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:00:20,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:00:20,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:00:20,031 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:00:20,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:00:20,032 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:00:20,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:00:20,032 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:00:20,032 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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI 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-03 04:00:20,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:00:20,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:00:20,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:00:20,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:00:20,384 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:00:20,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-03 04:00:20,481 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/bf8a765d4/cb94a73daf1d408894bc199b7994d826/FLAGa1bf8faca [2022-11-03 04:00:20,975 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:00:20,981 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-03 04:00:20,995 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/bf8a765d4/cb94a73daf1d408894bc199b7994d826/FLAGa1bf8faca [2022-11-03 04:00:21,303 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/bf8a765d4/cb94a73daf1d408894bc199b7994d826 [2022-11-03 04:00:21,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:00:21,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:00:21,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:21,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:00:21,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:00:21,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:21" (1/1) ... [2022-11-03 04:00:21,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4e964f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:21, skipping insertion in model container [2022-11-03 04:00:21,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:21" (1/1) ... [2022-11-03 04:00:21,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:00:21,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:00:21,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:21,809 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-03 04:00:21,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@27e41526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:21, skipping insertion in model container [2022-11-03 04:00:21,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:21,811 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-03 04:00:21,814 INFO L158 Benchmark]: Toolchain (without parser) took 501.73ms. Allocated memory is still 98.6MB. Free memory was 61.8MB in the beginning and 73.0MB in the end (delta: -11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 04:00:21,816 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 98.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:00:21,817 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.37ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 73.3MB in the end (delta: -11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 04:00:21,820 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.32ms. Allocated memory is still 98.6MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.37ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 73.3MB in the end (delta: -11.7MB). Peak memory consumption was 8.4MB. 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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI --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-5e519f3 [2022-11-03 04:00:24,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:00:24,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:00:24,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:00:24,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:00:24,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:00:24,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:00:24,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:00:24,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:00:24,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:00:24,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:00:24,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:00:24,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:00:24,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:00:24,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:00:24,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:00:24,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:00:24,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:00:24,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:00:24,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:00:24,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:00:24,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:00:24,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:00:24,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:00:24,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:00:24,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:00:24,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:00:24,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:00:24,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:00:24,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:00:24,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:00:24,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:00:24,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:00:24,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:00:24,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:00:24,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:00:24,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:00:24,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:00:24,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:00:24,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:00:24,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:00:24,220 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 04:00:24,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:00:24,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:00:24,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:00:24,249 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:00:24,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:00:24,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:00:24,250 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:00:24,250 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:00:24,250 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:00:24,251 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:00:24,251 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:00:24,251 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:00:24,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 04:00:24,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 04:00:24,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:00:24,253 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:00:24,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 04:00:24,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:00:24,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:00:24,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:00:24,254 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 04:00:24,254 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 04:00:24,254 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 04:00:24,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:00:24,265 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 04:00:24,266 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 04:00:24,266 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 04:00:24,267 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:00:24,267 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:00:24,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:00:24,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 04:00:24,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:00:24,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:00:24,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:00:24,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:00:24,268 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 04:00:24,269 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 04:00:24,269 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:00:24,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 04:00:24,269 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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/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_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI 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-03 04:00:24,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:00:24,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:00:24,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:00:24,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:00:24,757 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:00:24,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-03 04:00:24,856 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/67dfd8b91/4e9a0d57ad7044179f2777fe4706f007/FLAG161a3f7ce [2022-11-03 04:00:25,546 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:00:25,546 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-03 04:00:25,565 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/67dfd8b91/4e9a0d57ad7044179f2777fe4706f007/FLAG161a3f7ce [2022-11-03 04:00:25,835 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/data/67dfd8b91/4e9a0d57ad7044179f2777fe4706f007 [2022-11-03 04:00:25,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:00:25,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:00:25,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:25,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:00:25,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:00:25,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:25" (1/1) ... [2022-11-03 04:00:25,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef16378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:25, skipping insertion in model container [2022-11-03 04:00:25,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:25" (1/1) ... [2022-11-03 04:00:25,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:00:25,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:00:26,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:26,276 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-03 04:00:26,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:00:26,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:26,370 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:00:26,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:26,483 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:00:26,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26 WrapperNode [2022-11-03 04:00:26,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:26,485 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:00:26,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:00:26,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:00:26,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,571 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-11-03 04:00:26,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:00:26,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:00:26,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:00:26,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:00:26,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,615 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,638 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:00:26,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:00:26,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:00:26,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:00:26,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (1/1) ... [2022-11-03 04:00:26,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:00:26,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:26,693 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:00:26,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:00:26,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 04:00:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:00:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 04:00:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 04:00:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 04:00:26,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 04:00:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 04:00:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 04:00:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 04:00:26,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:00:26,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:00:26,907 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:00:26,909 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:00:27,656 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:00:27,671 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:00:27,671 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 04:00:27,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:00:27 BoogieIcfgContainer [2022-11-03 04:00:27,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:00:27,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:00:27,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:00:27,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:00:27,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:00:25" (1/3) ... [2022-11-03 04:00:27,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162212c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:00:27, skipping insertion in model container [2022-11-03 04:00:27,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:26" (2/3) ... [2022-11-03 04:00:27,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162212c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:00:27, skipping insertion in model container [2022-11-03 04:00:27,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:00:27" (3/3) ... [2022-11-03 04:00:27,684 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2022-11-03 04:00:27,703 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:00:27,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-03 04:00:27,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:00:27,789 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;@6d6be2d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:00:27,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-03 04:00:27,795 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-03 04:00:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 04:00:27,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:27,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 04:00:27,806 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-03 04:00:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-11-03 04:00:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:27,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720347673] [2022-11-03 04:00:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:27,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:27,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:27,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 04:00:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:27,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 04:00:27,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:28,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:28,133 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 04:00:28,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:28,164 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-03 04:00:28,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:28,166 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:28,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720347673] [2022-11-03 04:00:28,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720347673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:28,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:28,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:00:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002750356] [2022-11-03 04:00:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:28,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:00:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:00:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:00:28,225 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-03 04:00:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:28,729 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-11-03 04:00:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:00:28,735 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-03 04:00:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:28,748 INFO L225 Difference]: With dead ends: 148 [2022-11-03 04:00:28,748 INFO L226 Difference]: Without dead ends: 146 [2022-11-03 04:00:28,750 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-03 04:00:28,754 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-03 04:00:28,755 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-03 04:00:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-03 04:00:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2022-11-03 04:00:28,796 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-03 04:00:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-03 04:00:28,799 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2022-11-03 04:00:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:28,800 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-03 04:00:28,800 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-03 04:00:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-03 04:00:28,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 04:00:28,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:28,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 04:00:28,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:29,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:29,014 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-03 04:00:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-11-03 04:00:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:29,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480801251] [2022-11-03 04:00:29,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:29,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:29,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:29,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:29,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 04:00:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:29,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:00:29,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:29,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:29,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:29,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:29,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:29,198 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:29,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:29,220 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-03 04:00:29,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:29,220 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:29,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480801251] [2022-11-03 04:00:29,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480801251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:29,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:29,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:00:29,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456807597] [2022-11-03 04:00:29,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:29,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:00:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:29,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:00:29,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:00:29,229 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-03 04:00:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:29,801 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-11-03 04:00:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:00:29,805 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-03 04:00:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:29,806 INFO L225 Difference]: With dead ends: 236 [2022-11-03 04:00:29,806 INFO L226 Difference]: Without dead ends: 236 [2022-11-03 04:00:29,807 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-03 04:00:29,808 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 235 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:29,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 97 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:00:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-03 04:00:29,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2022-11-03 04:00:29,817 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-03 04:00:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2022-11-03 04:00:29,818 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2022-11-03 04:00:29,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:29,819 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2022-11-03 04:00:29,819 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-03 04:00:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2022-11-03 04:00:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 04:00:29,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:29,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 04:00:29,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:30,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:30,028 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-03 04:00:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-11-03 04:00:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:30,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925371890] [2022-11-03 04:00:30,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:30,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:30,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:30,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:30,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 04:00:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:30,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 04:00:30,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:30,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:30,130 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-03 04:00:30,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:30,130 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:30,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925371890] [2022-11-03 04:00:30,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925371890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:30,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:30,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:00:30,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458443128] [2022-11-03 04:00:30,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:30,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:30,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:30,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:30,134 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-03 04:00:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:30,358 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-03 04:00:30,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:30,360 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-03 04:00:30,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:30,361 INFO L225 Difference]: With dead ends: 136 [2022-11-03 04:00:30,361 INFO L226 Difference]: Without dead ends: 136 [2022-11-03 04:00:30,361 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-03 04:00:30,363 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-03 04:00:30,363 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-03 04:00:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-03 04:00:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-11-03 04:00:30,377 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-03 04:00:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-03 04:00:30,383 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2022-11-03 04:00:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:30,384 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-03 04:00:30,384 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-03 04:00:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-03 04:00:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 04:00:30,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:30,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 04:00:30,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:30,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:30,597 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-03 04:00:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-11-03 04:00:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:30,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572029913] [2022-11-03 04:00:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:30,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:30,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:30,599 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:30,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 04:00:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:30,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:00:30,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:30,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:30,696 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-03 04:00:30,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:30,697 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:30,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572029913] [2022-11-03 04:00:30,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572029913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:30,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:30,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:00:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242836610] [2022-11-03 04:00:30,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:30,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:30,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:30,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:30,699 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-03 04:00:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:31,037 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-11-03 04:00:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:31,038 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-03 04:00:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:31,039 INFO L225 Difference]: With dead ends: 180 [2022-11-03 04:00:31,039 INFO L226 Difference]: Without dead ends: 180 [2022-11-03 04:00:31,039 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-03 04:00:31,040 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.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:31,041 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.3s Time] [2022-11-03 04:00:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-03 04:00:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2022-11-03 04:00:31,048 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-03 04:00:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-11-03 04:00:31,049 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2022-11-03 04:00:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:31,050 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-11-03 04:00:31,050 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-03 04:00:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-11-03 04:00:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:00:31,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:31,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:31,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:31,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:31,263 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-03 04:00:31,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2022-11-03 04:00:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:31,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970601106] [2022-11-03 04:00:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:31,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:31,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 04:00:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:31,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 04:00:31,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:31,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:31,381 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 04:00:31,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:31,391 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-03 04:00:31,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:31,392 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:31,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970601106] [2022-11-03 04:00:31,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970601106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:31,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:31,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 04:00:31,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92918060] [2022-11-03 04:00:31,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:31,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:31,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:31,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:31,394 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-03 04:00:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:31,648 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-11-03 04:00:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:31,649 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-03 04:00:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:31,650 INFO L225 Difference]: With dead ends: 151 [2022-11-03 04:00:31,650 INFO L226 Difference]: Without dead ends: 151 [2022-11-03 04:00:31,650 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-03 04:00:31,651 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-03 04:00:31,652 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-03 04:00:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-03 04:00:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2022-11-03 04:00:31,657 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-03 04:00:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-11-03 04:00:31,658 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2022-11-03 04:00:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:31,658 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-11-03 04:00:31,659 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-03 04:00:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-11-03 04:00:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 04:00:31,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:31,659 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:31,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:31,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:31,881 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-03 04:00:31,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2022-11-03 04:00:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:31,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910663500] [2022-11-03 04:00:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:31,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:31,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:31,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:31,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 04:00:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:31,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:00:31,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:32,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:32,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:32,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:32,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:32,067 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:32,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:32,082 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-03 04:00:32,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:32,083 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910663500] [2022-11-03 04:00:32,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910663500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:32,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:32,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:00:32,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005689893] [2022-11-03 04:00:32,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:32,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:00:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:32,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:00:32,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:00:32,086 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-03 04:00:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:32,499 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-11-03 04:00:32,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:00:32,499 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-03 04:00:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:32,501 INFO L225 Difference]: With dead ends: 200 [2022-11-03 04:00:32,501 INFO L226 Difference]: Without dead ends: 200 [2022-11-03 04:00:32,501 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-03 04:00:32,502 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 183 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:32,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 166 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:00:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-03 04:00:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2022-11-03 04:00:32,508 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-03 04:00:32,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-11-03 04:00:32,508 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2022-11-03 04:00:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:32,509 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-11-03 04:00:32,509 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-03 04:00:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-11-03 04:00:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:00:32,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:32,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:32,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:32,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:32,723 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-03 04:00:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2022-11-03 04:00:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:32,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338552586] [2022-11-03 04:00:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:32,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:32,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:32,726 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:32,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 04:00:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:32,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 04:00:32,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:32,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:32,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:32,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:32,894 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-03 04:00:32,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:32,894 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:32,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338552586] [2022-11-03 04:00:32,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338552586] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:32,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:32,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:00:32,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98904206] [2022-11-03 04:00:32,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:32,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:00:32,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:32,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:00:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:00:32,897 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-03 04:00:33,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:33,325 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-11-03 04:00:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:00:33,331 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-03 04:00:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:33,332 INFO L225 Difference]: With dead ends: 109 [2022-11-03 04:00:33,332 INFO L226 Difference]: Without dead ends: 109 [2022-11-03 04:00:33,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:33,334 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:33,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 216 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:00:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-03 04:00:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-11-03 04:00:33,338 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-03 04:00:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-11-03 04:00:33,339 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2022-11-03 04:00:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:33,339 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-11-03 04:00:33,340 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-03 04:00:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-11-03 04:00:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:00:33,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:33,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:33,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:33,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:33,553 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-03 04:00:33,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:33,553 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2022-11-03 04:00:33,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:33,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091026351] [2022-11-03 04:00:33,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:33,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:33,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:33,555 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:33,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 04:00:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:33,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 04:00:33,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:33,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:33,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:33,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:33,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:33,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:33,839 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-03 04:00:33,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:33,839 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:33,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091026351] [2022-11-03 04:00:33,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091026351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:33,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:33,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:00:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307200659] [2022-11-03 04:00:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:33,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:00:33,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:33,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:00:33,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:33,841 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-03 04:00:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:34,292 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-11-03 04:00:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:00:34,293 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-03 04:00:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:34,294 INFO L225 Difference]: With dead ends: 104 [2022-11-03 04:00:34,294 INFO L226 Difference]: Without dead ends: 104 [2022-11-03 04:00:34,294 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-03 04:00:34,295 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:34,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:00:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-03 04:00:34,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-11-03 04:00:34,299 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-03 04:00:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-11-03 04:00:34,300 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2022-11-03 04:00:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:34,300 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-11-03 04:00:34,301 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-03 04:00:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-11-03 04:00:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 04:00:34,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:34,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:34,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:34,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:34,511 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-03 04:00:34,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2022-11-03 04:00:34,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:34,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820855875] [2022-11-03 04:00:34,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:34,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:34,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:34,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:34,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 04:00:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:34,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:00:34,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:34,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:34,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:34,785 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:34,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:34,864 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-03 04:00:34,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:34,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:34,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820855875] [2022-11-03 04:00:34,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820855875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:34,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:34,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:00:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108112411] [2022-11-03 04:00:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:34,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:00:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:00:34,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:34,867 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-03 04:00:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:35,231 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-03 04:00:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:00:35,231 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-03 04:00:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:35,232 INFO L225 Difference]: With dead ends: 133 [2022-11-03 04:00:35,232 INFO L226 Difference]: Without dead ends: 133 [2022-11-03 04:00:35,233 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-03 04:00:35,233 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 411 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:35,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 65 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:00:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-03 04:00:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2022-11-03 04:00:35,237 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-03 04:00:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-11-03 04:00:35,237 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2022-11-03 04:00:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:35,238 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-11-03 04:00:35,238 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-03 04:00:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-11-03 04:00:35,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:00:35,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:35,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:35,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:35,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:35,439 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-03 04:00:35,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2022-11-03 04:00:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:35,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049916759] [2022-11-03 04:00:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:35,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:35,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:35,442 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:35,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 04:00:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:35,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:00:35,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:35,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:35,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:35,708 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-03 04:00:35,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:35,709 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:35,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049916759] [2022-11-03 04:00:35,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049916759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:35,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:35,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:00:35,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977207317] [2022-11-03 04:00:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:35,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:00:35,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:35,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:00:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:00:35,711 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-03 04:00:36,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:36,015 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-11-03 04:00:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:00:36,015 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-03 04:00:36,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:36,016 INFO L225 Difference]: With dead ends: 137 [2022-11-03 04:00:36,016 INFO L226 Difference]: Without dead ends: 137 [2022-11-03 04:00:36,017 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-03 04:00:36,017 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 164 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:36,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 174 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 04:00:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-03 04:00:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2022-11-03 04:00:36,022 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-03 04:00:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-03 04:00:36,023 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2022-11-03 04:00:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:36,023 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-03 04:00:36,023 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-03 04:00:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-03 04:00:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:00:36,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:36,024 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:36,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:36,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:36,231 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-03 04:00:36,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2022-11-03 04:00:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:36,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981209955] [2022-11-03 04:00:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:36,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:36,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:36,233 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:36,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 04:00:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:36,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 04:00:36,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:36,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:36,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:36,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:36,525 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-03 04:00:36,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:36,525 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:36,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981209955] [2022-11-03 04:00:36,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981209955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:36,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:36,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:00:36,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804695244] [2022-11-03 04:00:36,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:36,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:00:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:00:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:00:36,528 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-03 04:00:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:37,012 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-03 04:00:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:00:37,013 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-03 04:00:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:37,014 INFO L225 Difference]: With dead ends: 129 [2022-11-03 04:00:37,014 INFO L226 Difference]: Without dead ends: 129 [2022-11-03 04:00:37,014 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-03 04:00:37,015 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03 04:00:37,015 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-03 04:00:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-03 04:00:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2022-11-03 04:00:37,018 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-03 04:00:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-11-03 04:00:37,019 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2022-11-03 04:00:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:37,019 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-11-03 04:00:37,019 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-03 04:00:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-11-03 04:00:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 04:00:37,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:37,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:37,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:37,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:37,230 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-03 04:00:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2022-11-03 04:00:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:37,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713874278] [2022-11-03 04:00:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:37,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:37,232 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:37,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 04:00:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:37,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 04:00:37,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:37,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:37,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:37,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:37,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:37,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:37,592 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-03 04:00:37,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:37,592 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:37,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713874278] [2022-11-03 04:00:37,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713874278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:37,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:37,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:00:37,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093028763] [2022-11-03 04:00:37,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:37,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:00:37,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:37,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:00:37,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:00:37,594 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-03 04:00:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:38,201 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-11-03 04:00:38,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:00:38,202 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-03 04:00:38,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:38,203 INFO L225 Difference]: With dead ends: 201 [2022-11-03 04:00:38,203 INFO L226 Difference]: Without dead ends: 201 [2022-11-03 04:00:38,204 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-03 04:00:38,204 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:38,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 221 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:00:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-03 04:00:38,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2022-11-03 04:00:38,211 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-03 04:00:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-11-03 04:00:38,212 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2022-11-03 04:00:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:38,212 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-11-03 04:00:38,212 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-03 04:00:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-11-03 04:00:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 04:00:38,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:38,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:38,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:38,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:38,414 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-03 04:00:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:38,414 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2022-11-03 04:00:38,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:38,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073938945] [2022-11-03 04:00:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:38,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:38,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:38,417 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:38,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 04:00:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:38,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:00:38,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:38,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:38,631 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:00:38,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:38,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:38,777 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:38,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:38,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:38,875 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-03 04:00:38,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:38,991 WARN L833 $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-03 04:00:39,033 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:39,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-03 04:00:39,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:39,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:43,191 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-03 04:00:43,192 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:43,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073938945] [2022-11-03 04:00:43,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073938945] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:43,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1575185782] [2022-11-03 04:00:43,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:43,192 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:00:43,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:00:43,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:00:43,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-03 04:00:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:43,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 04:00:43,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:43,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:43,488 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:00:43,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:43,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:43,581 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:43,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:43,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:43,646 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-03 04:00:43,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:43,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:43,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-03 04:00:43,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:43,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:43,791 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-03 04:00:43,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1575185782] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:43,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343469008] [2022-11-03 04:00:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:43,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:43,800 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:43,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 04:00:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:43,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:00:43,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:43,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:43,954 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:00:43,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:43,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:44,063 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:44,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:44,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:44,127 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-03 04:00:44,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:44,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:44,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-03 04:00:44,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:44,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:44,263 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-03 04:00:44,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343469008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:44,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 04:00:44,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7, 6, 7] total 12 [2022-11-03 04:00:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017924519] [2022-11-03 04:00:44,264 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:44,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 04:00:44,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 04:00:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=95, Unknown=3, NotChecked=20, Total=156 [2022-11-03 04:00:44,266 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:44,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:44,860 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-11-03 04:00:44,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:00:44,861 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-03 04:00:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:44,862 INFO L225 Difference]: With dead ends: 154 [2022-11-03 04:00:44,862 INFO L226 Difference]: Without dead ends: 154 [2022-11-03 04:00:44,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=46, Invalid=111, Unknown=3, NotChecked=22, Total=182 [2022-11-03 04:00:44,863 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 78 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:44,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 562 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 330 Unchecked, 0.5s Time] [2022-11-03 04:00:44,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-03 04:00:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2022-11-03 04:00:44,870 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-03 04:00:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-11-03 04:00:44,871 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2022-11-03 04:00:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:44,871 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-11-03 04:00:44,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-11-03 04:00:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-03 04:00:44,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:44,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:44,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:45,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:45,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2022-11-03 04:00:45,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 04:00:45,480 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-03 04:00:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2022-11-03 04:00:45,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:45,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347135373] [2022-11-03 04:00:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:45,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:45,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:45,483 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:45,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 04:00:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:45,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 04:00:45,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:45,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:45,687 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:45,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:45,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:45,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:45,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:45,903 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:45,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:45,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:46,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:46,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:46,061 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-03 04:00:46,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:46,625 WARN L833 $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-03 04:00:46,691 WARN L833 $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-03 04:00:46,755 WARN L833 $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-03 04:00:46,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:46,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-03 04:00:46,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:46,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:00:46,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:46,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:46,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-03 04:00:46,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-11-03 04:00:46,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:46,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-03 04:00:46,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:47,138 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-03 04:00:47,138 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:47,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347135373] [2022-11-03 04:00:47,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347135373] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:47,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [192740128] [2022-11-03 04:00:47,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:47,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:00:47,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:00:47,144 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:00:47,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-03 04:00:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:47,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 04:00:47,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:47,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:47,462 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:47,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:47,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:47,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:47,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:47,588 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:47,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:47,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:47,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:47,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:47,688 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-03 04:00:47,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:47,885 WARN L833 $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-03 04:00:47,961 WARN L833 $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-03 04:00:48,033 WARN L833 $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-03 04:00:48,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:48,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-03 04:00:48,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:48,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-03 04:00:48,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:48,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:00:48,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:00:48,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:00:48,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,134 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-03 04:00:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [192740128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408397792] [2022-11-03 04:00:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:48,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:48,140 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:48,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 04:00:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:48,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 04:00:48,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:48,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:48,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:48,296 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:48,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:48,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:48,421 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:48,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,522 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-03 04:00:48,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:48,721 WARN L833 $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-03 04:00:48,782 WARN L833 $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-03 04:00:48,848 WARN L833 $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-03 04:00:48,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:48,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-03 04:00:48,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:48,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-03 04:00:48,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:48,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-03 04:00:48,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-11-03 04:00:49,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:49,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-03 04:00:49,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:49,182 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-03 04:00:49,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408397792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:49,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 04:00:49,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 21 [2022-11-03 04:00:49,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129124311] [2022-11-03 04:00:49,183 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:49,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 04:00:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:49,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 04:00:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=130, Unknown=9, NotChecked=270, Total=462 [2022-11-03 04:00:49,185 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-03 04:00:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:54,023 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-11-03 04:00:54,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:00:54,025 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-03 04:00:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:54,026 INFO L225 Difference]: With dead ends: 160 [2022-11-03 04:00:54,026 INFO L226 Difference]: Without dead ends: 160 [2022-11-03 04:00:54,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=104, Invalid=303, Unknown=9, NotChecked=396, Total=812 [2022-11-03 04:00:54,027 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 74 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:54,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 928 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 467 Invalid, 0 Unknown, 879 Unchecked, 2.4s Time] [2022-11-03 04:00:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-03 04:00:54,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2022-11-03 04:00:54,031 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-03 04:00:54,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-11-03 04:00:54,032 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2022-11-03 04:00:54,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:54,032 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-11-03 04:00:54,032 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-03 04:00:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-11-03 04:00:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:00:54,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:54,033 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-03 04:00:54,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:54,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:54,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:54,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:54,636 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-03 04:00:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:54,637 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2022-11-03 04:00:54,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:54,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729903624] [2022-11-03 04:00:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:54,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:54,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:54,639 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:54,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-03 04:00:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:54,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 04:00:54,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:54,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:54,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:54,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:54,936 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-03 04:00:54,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:54,936 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:54,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729903624] [2022-11-03 04:00:54,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729903624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:54,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:54,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:00:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783228451] [2022-11-03 04:00:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:54,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:00:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:54,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:00:54,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:00:54,939 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-03 04:00:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:55,416 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-11-03 04:00:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:00:55,416 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-03 04:00:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:55,417 INFO L225 Difference]: With dead ends: 146 [2022-11-03 04:00:55,417 INFO L226 Difference]: Without dead ends: 146 [2022-11-03 04:00:55,418 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-03 04:00:55,418 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.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:55,418 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.4s Time] [2022-11-03 04:00:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-03 04:00:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2022-11-03 04:00:55,421 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-03 04:00:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-03 04:00:55,422 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2022-11-03 04:00:55,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:55,422 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-03 04:00:55,422 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-03 04:00:55,423 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-03 04:00:55,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 04:00:55,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:55,423 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-03 04:00:55,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:55,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:55,633 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-03 04:00:55,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2022-11-03 04:00:55,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409087156] [2022-11-03 04:00:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:55,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:55,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:55,636 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:55,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-03 04:00:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:55,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 04:00:55,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:55,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:00:55,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:55,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:55,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:55,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:56,013 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-03 04:00:56,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:56,014 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:56,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409087156] [2022-11-03 04:00:56,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409087156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:56,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:56,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:00:56,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767165615] [2022-11-03 04:00:56,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:56,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:00:56,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:00:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:00:56,015 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-03 04:00:56,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:56,630 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-11-03 04:00:56,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:00:56,630 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-03 04:00:56,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:56,632 INFO L225 Difference]: With dead ends: 203 [2022-11-03 04:00:56,632 INFO L226 Difference]: Without dead ends: 203 [2022-11-03 04:00:56,632 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-03 04:00:56,633 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 164 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:56,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 187 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:00:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-03 04:00:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2022-11-03 04:00:56,637 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-03 04:00:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-11-03 04:00:56,637 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2022-11-03 04:00:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:56,638 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-11-03 04:00:56,638 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-03 04:00:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-11-03 04:00:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:00:56,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:56,639 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-03 04:00:56,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:56,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:56,851 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-03 04:00:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:56,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2022-11-03 04:00:56,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:56,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299095492] [2022-11-03 04:00:56,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:56,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:56,853 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:56,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 04:00:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:56,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 04:00:57,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:57,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:57,028 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:57,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:57,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:57,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:00:57,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:57,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:57,445 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 04:00:57,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:57,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-03 04:00:57,509 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-03 04:00:57,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:57,509 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:00:57,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299095492] [2022-11-03 04:00:57,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299095492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:57,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:57,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 04:00:57,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996987098] [2022-11-03 04:00:57,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:57,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 04:00:57,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:00:57,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 04:00:57,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-03 04:00:57,512 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-03 04:00:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:58,820 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2022-11-03 04:00:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:00:58,820 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-03 04:00:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:58,821 INFO L225 Difference]: With dead ends: 183 [2022-11-03 04:00:58,821 INFO L226 Difference]: Without dead ends: 183 [2022-11-03 04:00:58,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-11-03 04:00:58,822 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 207 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:58,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 493 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 358 Invalid, 0 Unknown, 62 Unchecked, 0.9s Time] [2022-11-03 04:00:58,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-03 04:00:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 128. [2022-11-03 04:00:58,826 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-03 04:00:58,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-11-03 04:00:58,830 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2022-11-03 04:00:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:58,830 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-11-03 04:00:58,830 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-03 04:00:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-11-03 04:00:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 04:00:58,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:58,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:58,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-11-03 04:00:59,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:00:59,035 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-03 04:00:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2022-11-03 04:00:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:00:59,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910228904] [2022-11-03 04:00:59,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:00:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:00:59,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:00:59,037 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:00:59,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-03 04:00:59,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 04:00:59,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:59,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 04:00:59,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:59,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:00:59,291 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:00:59,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:59,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:00:59,517 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:59,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,756 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:00:59,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:00:59,921 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-03 04:00:59,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:07,633 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:07,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 142 [2022-11-03 04:01:07,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:07,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2022-11-03 04:01:07,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:07,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:07,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 157 [2022-11-03 04:01:07,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 167 [2022-11-03 04:01:07,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 92 [2022-11-03 04:01:08,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:08,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 152 [2022-11-03 04:01:08,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:08,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 86 [2022-11-03 04:01:08,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:08,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:08,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 950 [2022-11-03 04:01:08,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 870 [2022-11-03 04:01:08,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 982 treesize of output 934 [2022-11-03 04:01:08,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 908 treesize of output 748 [2022-11-03 04:01:57,191 WARN L234 SmtUtils]: Spent 32.93s on a formula simplification. DAG size of input: 113 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:01:57,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:57,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 230 [2022-11-03 04:01:57,701 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-03 04:01:57,701 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:01:57,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910228904] [2022-11-03 04:01:57,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910228904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:57,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2092494746] [2022-11-03 04:01:57,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:01:57,702 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:01:57,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:01:57,709 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:01:57,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-03 04:01:58,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 04:01:58,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:01:58,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 04:01:58,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:58,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:01:58,188 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:01:58,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:01:58,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:01:58,412 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:01:58,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,784 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:01:58,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:01:58,988 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-03 04:01:58,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:59,359 WARN L833 $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-03 04:01:59,454 WARN L833 $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-03 04:01:59,582 WARN L833 $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-03 04:01:59,807 WARN L833 $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-03 04:01:59,984 WARN L833 $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-03 04:02:00,116 WARN L833 $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-03 04:02:00,156 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:00,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-03 04:02:00,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:00,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-03 04:02:00,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:00,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:00,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 630 treesize of output 582 [2022-11-03 04:02:00,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 582 treesize of output 534 [2022-11-03 04:02:00,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 430 [2022-11-03 04:02:00,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 430 treesize of output 414 [2022-11-03 04:02:09,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:09,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-03 04:02:09,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:09,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-03 04:02:09,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:09,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:09,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2022-11-03 04:02:09,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-11-03 04:02:09,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-11-03 04:02:09,776 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-03 04:02:09,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2092494746] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:09,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978936507] [2022-11-03 04:02:09,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-03 04:02:09,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:09,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:09,778 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:09,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 04:02:09,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-03 04:02:09,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:09,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 04:02:09,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:09,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:10,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:02:10,039 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:02:10,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:10,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:02:10,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:02:10,271 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:10,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:10,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:10,513 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:02:10,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:10,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:10,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:10,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:10,702 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-03 04:02:10,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:11,063 WARN L833 $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-03 04:02:11,150 WARN L833 $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-03 04:02:11,270 WARN L833 $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-03 04:02:11,494 WARN L833 $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-03 04:02:11,834 WARN L833 $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-03 04:02:11,933 WARN L833 $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-03 04:02:11,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:11,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-03 04:02:12,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:12,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-03 04:02:12,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:12,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:12,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1254 treesize of output 1158 [2022-11-03 04:02:12,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1158 treesize of output 1062 [2022-11-03 04:02:12,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1062 treesize of output 862 [2022-11-03 04:02:12,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 862 treesize of output 830 [2022-11-03 04:02:19,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:19,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-03 04:02:19,226 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:19,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-03 04:02:19,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:19,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:19,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2022-11-03 04:02:19,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 162 [2022-11-03 04:02:19,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 160 [2022-11-03 04:02:19,363 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-03 04:02:19,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978936507] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:19,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 04:02:19,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10, 12, 10, 12] total 34 [2022-11-03 04:02:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609596687] [2022-11-03 04:02:19,364 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:19,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:02:19,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:19,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:02:19,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=404, Unknown=25, NotChecked=636, Total=1190 [2022-11-03 04:02:19,366 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-03 04:02:29,000 WARN L833 $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|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse7 (bvadd (_ bv8 32) .cse1 .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse0 (bvule .cse7 (select |c_#length| .cse2))) (.cse5 (bvule (bvadd (_ bv4 32) .cse1 .cse6) .cse7))) (and .cse0 (or (and (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse1 .cse4) (bvadd .cse1 .cse4 (_ bv12 32)))))) (not .cse0) (not .cse5)) .cse5))))) is different from false [2022-11-03 04:02:29,170 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (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|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (bvadd (_ bv4 32) .cse1 .cse6)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse0 (bvule .cse7 (select |c_#length| .cse3))) (.cse5 (bvule (bvadd .cse1 .cse6) .cse7))) (and .cse0 (or (not .cse0) (and (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2)))) (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))) (not .cse5)) .cse5))))) is different from false [2022-11-03 04:02:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:33,363 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2022-11-03 04:02:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-03 04:02:33,363 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-03 04:02:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:33,364 INFO L225 Difference]: With dead ends: 182 [2022-11-03 04:02:33,365 INFO L226 Difference]: Without dead ends: 182 [2022-11-03 04:02:33,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=265, Invalid=946, Unknown=35, NotChecked=1106, Total=2352 [2022-11-03 04:02:33,366 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 104 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1800 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:33,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 942 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 303 Invalid, 0 Unknown, 1800 Unchecked, 3.2s Time] [2022-11-03 04:02:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-03 04:02:33,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2022-11-03 04:02:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 116 states have (on average 1.353448275862069) internal successors, (157), 142 states have internal predecessors, (157), 0 states have call successors, (0), 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-03 04:02:33,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2022-11-03 04:02:33,370 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 23 [2022-11-03 04:02:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:33,371 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2022-11-03 04:02:33,371 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-03 04:02:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2022-11-03 04:02:33,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:02:33,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:33,372 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-03 04:02:33,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:33,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:33,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-11-03 04:02:33,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:33,976 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-03 04:02:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:33,977 INFO L85 PathProgramCache]: Analyzing trace with hash -543267076, now seen corresponding path program 1 times [2022-11-03 04:02:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:33,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229867457] [2022-11-03 04:02:33,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:33,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:33,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:33,979 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:33,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-03 04:02:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:34,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:02:34,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:34,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:34,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:34,384 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-03 04:02:34,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:34,385 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:34,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229867457] [2022-11-03 04:02:34,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229867457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:34,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:34,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:02:34,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272683215] [2022-11-03 04:02:34,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:34,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:02:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:02:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:02:34,387 INFO L87 Difference]: Start difference. First operand 143 states and 157 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-03 04:02:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:34,885 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2022-11-03 04:02:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:02:34,885 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-03 04:02:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:34,887 INFO L225 Difference]: With dead ends: 177 [2022-11-03 04:02:34,887 INFO L226 Difference]: Without dead ends: 177 [2022-11-03 04:02:34,887 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-03 04:02:34,888 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 155 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:34,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 169 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:02:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-03 04:02:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2022-11-03 04:02:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.421875) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 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-03 04:02:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2022-11-03 04:02:34,893 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 25 [2022-11-03 04:02:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:34,894 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2022-11-03 04:02:34,894 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-03 04:02:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2022-11-03 04:02:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 04:02:34,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:34,895 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-03 04:02:34,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:35,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:35,107 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-03 04:02:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash 338589996, now seen corresponding path program 1 times [2022-11-03 04:02:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:35,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553917122] [2022-11-03 04:02:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:35,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:35,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:35,109 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:35,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-03 04:02:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:35,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 04:02:35,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:35,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:35,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:35,818 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-03 04:02:35,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:35,818 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553917122] [2022-11-03 04:02:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553917122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:35,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:35,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:02:35,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576452294] [2022-11-03 04:02:35,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:35,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:02:35,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:35,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:02:35,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:02:35,820 INFO L87 Difference]: Start difference. First operand 155 states and 182 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-03 04:02:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:36,571 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2022-11-03 04:02:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:02:36,572 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-03 04:02:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:36,573 INFO L225 Difference]: With dead ends: 178 [2022-11-03 04:02:36,573 INFO L226 Difference]: Without dead ends: 178 [2022-11-03 04:02:36,574 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-03 04:02:36,574 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 264 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:36,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 144 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:02:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-03 04:02:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2022-11-03 04:02:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 129 states have (on average 1.4186046511627908) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 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-03 04:02:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2022-11-03 04:02:36,580 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 26 [2022-11-03 04:02:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:36,580 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2022-11-03 04:02:36,581 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-03 04:02:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2022-11-03 04:02:36,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 04:02:36,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:36,582 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-03 04:02:36,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:36,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:36,795 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-03 04:02:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1906355454, now seen corresponding path program 1 times [2022-11-03 04:02:36,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:36,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276489178] [2022-11-03 04:02:36,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:36,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:36,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:36,797 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:36,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-03 04:02:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:36,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-03 04:02:36,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:36,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:37,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:37,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:37,221 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-03 04:02:37,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:37,221 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:37,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276489178] [2022-11-03 04:02:37,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276489178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:37,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:37,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:02:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475969239] [2022-11-03 04:02:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:37,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:02:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:37,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:02:37,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:02:37,223 INFO L87 Difference]: Start difference. First operand 156 states and 183 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-03 04:02:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:37,977 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-11-03 04:02:37,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:02:37,978 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-03 04:02:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:37,979 INFO L225 Difference]: With dead ends: 177 [2022-11-03 04:02:37,979 INFO L226 Difference]: Without dead ends: 177 [2022-11-03 04:02:37,980 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-03 04:02:37,981 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.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:37,981 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.7s Time] [2022-11-03 04:02:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-03 04:02:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2022-11-03 04:02:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.4090909090909092) internal successors, (186), 158 states have internal predecessors, (186), 0 states have call successors, (0), 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-03 04:02:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2022-11-03 04:02:37,986 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 27 [2022-11-03 04:02:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:37,987 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2022-11-03 04:02:37,987 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-03 04:02:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2022-11-03 04:02:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 04:02:37,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:37,990 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-03 04:02:38,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:38,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:38,204 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-03 04:02:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:38,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823547, now seen corresponding path program 1 times [2022-11-03 04:02:38,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:38,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291917170] [2022-11-03 04:02:38,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:38,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:38,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:38,206 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:38,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-03 04:02:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:38,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 04:02:38,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:38,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:38,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:39,092 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:02:39,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:39,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:39,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:39,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:39,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:39,612 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-03 04:02:39,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:39,612 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:39,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291917170] [2022-11-03 04:02:39,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291917170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:39,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:39,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 04:02:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623120092] [2022-11-03 04:02:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:02:39,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:02:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:02:39,614 INFO L87 Difference]: Start difference. First operand 159 states and 186 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-03 04:02:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:42,437 INFO L93 Difference]: Finished difference Result 214 states and 242 transitions. [2022-11-03 04:02:42,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 04:02:42,438 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-03 04:02:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:42,438 INFO L225 Difference]: With dead ends: 214 [2022-11-03 04:02:42,438 INFO L226 Difference]: Without dead ends: 214 [2022-11-03 04:02:42,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2022-11-03 04:02:42,439 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 215 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:42,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 365 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 408 Invalid, 0 Unknown, 83 Unchecked, 1.6s Time] [2022-11-03 04:02:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-03 04:02:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 164. [2022-11-03 04:02:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3985507246376812) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 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-03 04:02:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2022-11-03 04:02:42,445 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 27 [2022-11-03 04:02:42,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:42,445 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2022-11-03 04:02:42,445 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-03 04:02:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2022-11-03 04:02:42,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 04:02:42,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:42,446 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-03 04:02:42,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:42,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:42,651 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-03 04:02:42,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823546, now seen corresponding path program 1 times [2022-11-03 04:02:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:42,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282386597] [2022-11-03 04:02:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:42,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:42,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:42,653 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:42,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-03 04:02:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:42,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 04:02:42,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:42,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:42,911 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:02:42,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:43,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 04:02:43,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:43,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:43,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:43,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:43,983 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-03 04:02:43,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:43,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-03 04:02:44,140 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-03 04:02:44,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:44,141 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:44,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282386597] [2022-11-03 04:02:44,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282386597] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:44,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:44,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 04:02:44,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38741074] [2022-11-03 04:02:44,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:44,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:02:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:44,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:02:44,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:02:44,142 INFO L87 Difference]: Start difference. First operand 164 states and 193 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-03 04:02:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:48,070 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2022-11-03 04:02:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:02:48,071 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-03 04:02:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:48,072 INFO L225 Difference]: With dead ends: 226 [2022-11-03 04:02:48,072 INFO L226 Difference]: Without dead ends: 226 [2022-11-03 04:02:48,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2022-11-03 04:02:48,073 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 290 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:48,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 385 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 627 Invalid, 0 Unknown, 92 Unchecked, 2.5s Time] [2022-11-03 04:02:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-03 04:02:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 174. [2022-11-03 04:02:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 148 states have (on average 1.4054054054054055) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 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-03 04:02:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-11-03 04:02:48,077 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 27 [2022-11-03 04:02:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:48,077 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-11-03 04:02:48,077 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-03 04:02:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-11-03 04:02:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:02:48,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:48,078 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-03 04:02:48,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:48,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:48,287 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-03 04:02:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522897, now seen corresponding path program 1 times [2022-11-03 04:02:48,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:48,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447326564] [2022-11-03 04:02:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:48,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:48,289 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:48,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-03 04:02:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:48,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 04:02:48,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:48,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:48,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:49,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:49,409 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:02:49,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:49,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:49,548 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-03 04:02:49,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:49,548 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447326564] [2022-11-03 04:02:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447326564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:49,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:49,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 04:02:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669232500] [2022-11-03 04:02:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:49,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:02:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:02:49,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:02:49,551 INFO L87 Difference]: Start difference. First operand 174 states and 208 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-03 04:02:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:52,423 INFO L93 Difference]: Finished difference Result 198 states and 222 transitions. [2022-11-03 04:02:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:02:52,424 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-03 04:02:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:52,425 INFO L225 Difference]: With dead ends: 198 [2022-11-03 04:02:52,425 INFO L226 Difference]: Without dead ends: 198 [2022-11-03 04:02:52,426 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-03 04:02:52,426 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 432 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:52,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 299 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-03 04:02:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-03 04:02:52,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2022-11-03 04:02:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 174 states have internal predecessors, (210), 0 states have call successors, (0), 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-03 04:02:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 210 transitions. [2022-11-03 04:02:52,432 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 210 transitions. Word has length 28 [2022-11-03 04:02:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:52,432 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 210 transitions. [2022-11-03 04:02:52,432 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-03 04:02:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2022-11-03 04:02:52,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 04:02:52,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:52,433 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-03 04:02:52,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-11-03 04:02:52,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:52,645 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-03 04:02:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522896, now seen corresponding path program 1 times [2022-11-03 04:02:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:52,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863184512] [2022-11-03 04:02:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:52,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:52,648 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:52,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-03 04:02:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:52,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 04:02:52,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:53,062 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-03 04:02:53,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:53,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863184512] [2022-11-03 04:02:53,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863184512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:53,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:53,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:02:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069276111] [2022-11-03 04:02:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:53,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:02:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:02:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:02:53,065 INFO L87 Difference]: Start difference. First operand 175 states and 210 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-03 04:02:53,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:53,276 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2022-11-03 04:02:53,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:02:53,277 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-03 04:02:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:53,280 INFO L225 Difference]: With dead ends: 170 [2022-11-03 04:02:53,280 INFO L226 Difference]: Without dead ends: 170 [2022-11-03 04:02:53,280 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-03 04:02:53,281 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:53,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 49 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:02:53,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-03 04:02:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-03 04:02:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3557046979865772) internal successors, (202), 169 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-03 04:02:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2022-11-03 04:02:53,288 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 28 [2022-11-03 04:02:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:53,288 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2022-11-03 04:02:53,288 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-03 04:02:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2022-11-03 04:02:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:02:53,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:53,289 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-03 04:02:53,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:53,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:53,501 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-03 04:02:53,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1614814932, now seen corresponding path program 1 times [2022-11-03 04:02:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:53,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252738326] [2022-11-03 04:02:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:53,503 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:53,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-03 04:02:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:53,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 04:02:53,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:53,822 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-03 04:02:53,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:54,055 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-03 04:02:54,055 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252738326] [2022-11-03 04:02:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252738326] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1645639093] [2022-11-03 04:02:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:54,056 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:02:54,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:02:54,057 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:02:54,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-03 04:02:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:54,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 04:02:54,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:54,450 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-03 04:02:54,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:54,546 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-03 04:02:54,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1645639093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:54,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33702913] [2022-11-03 04:02:54,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:54,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:54,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:54,548 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:54,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-03 04:02:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:54,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 04:02:54,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:54,797 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-03 04:02:54,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:55,167 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-03 04:02:55,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33702913] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:55,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 04:02:55,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 7] total 13 [2022-11-03 04:02:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353810523] [2022-11-03 04:02:55,168 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:55,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 04:02:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:55,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 04:02:55,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-03 04:02:55,170 INFO L87 Difference]: Start difference. First operand 170 states and 202 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-03 04:02:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:56,036 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2022-11-03 04:02:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:02:56,037 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-03 04:02:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:56,038 INFO L225 Difference]: With dead ends: 253 [2022-11-03 04:02:56,039 INFO L226 Difference]: Without dead ends: 253 [2022-11-03 04:02:56,039 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-03 04:02:56,039 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 250 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:56,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 815 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:02:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-03 04:02:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 183. [2022-11-03 04:02:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3271604938271604) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 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-03 04:02:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-11-03 04:02:56,047 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 30 [2022-11-03 04:02:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:56,048 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-11-03 04:02:56,059 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-03 04:02:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-11-03 04:02:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:02:56,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:56,060 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-03 04:02:56,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:56,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:56,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:56,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:02:56,665 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-03 04:02:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash -842646633, now seen corresponding path program 1 times [2022-11-03 04:02:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:02:56,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092972787] [2022-11-03 04:02:56,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:02:56,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:02:56,666 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:02:56,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-03 04:02:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:56,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 04:02:56,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:56,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:02:56,943 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:02:56,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:57,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:57,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:57,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:02:57,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:57,802 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:02:57,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:02:57,954 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-03 04:02:57,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:57,954 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:02:57,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092972787] [2022-11-03 04:02:57,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092972787] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:57,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:02:57,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 04:02:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197114586] [2022-11-03 04:02:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:57,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:02:57,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:02:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:02:57,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:02:57,956 INFO L87 Difference]: Start difference. First operand 183 states and 215 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-03 04:03:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:01,505 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2022-11-03 04:03:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:03:01,507 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-03 04:03:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:01,507 INFO L225 Difference]: With dead ends: 228 [2022-11-03 04:03:01,507 INFO L226 Difference]: Without dead ends: 228 [2022-11-03 04:03:01,508 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-03 04:03:01,508 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 277 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:01,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 413 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 528 Invalid, 0 Unknown, 83 Unchecked, 2.2s Time] [2022-11-03 04:03:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-03 04:03:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 183. [2022-11-03 04:03:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 182 states have internal predecessors, (213), 0 states have call successors, (0), 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-03 04:03:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2022-11-03 04:03:01,514 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 30 [2022-11-03 04:03:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:01,514 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2022-11-03 04:03:01,514 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-03 04:03:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2022-11-03 04:03:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:03:01,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:01,515 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-03 04:03:01,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:01,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:03:01,729 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-03 04:03:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash -842657618, now seen corresponding path program 1 times [2022-11-03 04:03:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:03:01,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228626843] [2022-11-03 04:03:01,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:01,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:03:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:03:01,731 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:03:01,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-03 04:03:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:01,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:03:01,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:01,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:01,969 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-03 04:03:01,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:03:01,969 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:03:01,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228626843] [2022-11-03 04:03:01,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228626843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:01,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:01,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:03:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806416566] [2022-11-03 04:03:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:01,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:03:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:03:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:03:01,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:03:01,971 INFO L87 Difference]: Start difference. First operand 183 states and 213 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-03 04:03:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:02,422 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2022-11-03 04:03:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:03:02,424 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-03 04:03:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:02,425 INFO L225 Difference]: With dead ends: 199 [2022-11-03 04:03:02,425 INFO L226 Difference]: Without dead ends: 199 [2022-11-03 04:03:02,425 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-03 04:03:02,426 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-03 04:03:02,426 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-03 04:03:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-03 04:03:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2022-11-03 04:03:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 181 states have internal predecessors, (210), 0 states have call successors, (0), 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-03 04:03:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2022-11-03 04:03:02,431 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 30 [2022-11-03 04:03:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:02,432 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2022-11-03 04:03:02,432 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-03 04:03:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2022-11-03 04:03:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 04:03:02,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:02,433 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-03 04:03:02,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-11-03 04:03:02,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:03:02,646 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-03 04:03:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:02,647 INFO L85 PathProgramCache]: Analyzing trace with hash -352582234, now seen corresponding path program 1 times [2022-11-03 04:03:02,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:03:02,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575927937] [2022-11-03 04:03:02,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:02,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:03:02,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:03:02,649 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:03:02,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-03 04:03:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:02,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 04:03:02,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:03,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:03,131 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-03 04:03:03,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:03:03,131 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:03:03,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575927937] [2022-11-03 04:03:03,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575927937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:03:03,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:03:03,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:03:03,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120398064] [2022-11-03 04:03:03,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:03:03,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:03:03,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:03:03,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:03:03,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:03:03,133 INFO L87 Difference]: Start difference. First operand 182 states and 210 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-03 04:03:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:03,735 INFO L93 Difference]: Finished difference Result 197 states and 220 transitions. [2022-11-03 04:03:03,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 04:03:03,736 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-03 04:03:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:03,737 INFO L225 Difference]: With dead ends: 197 [2022-11-03 04:03:03,737 INFO L226 Difference]: Without dead ends: 197 [2022-11-03 04:03:03,738 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-03 04:03:03,738 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:03,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 04:03:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-03 04:03:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2022-11-03 04:03:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 179 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-03 04:03:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2022-11-03 04:03:03,744 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 31 [2022-11-03 04:03:03,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:03,744 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2022-11-03 04:03:03,745 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-03 04:03:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2022-11-03 04:03:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:03:03,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:03,746 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-03 04:03:03,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:03,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:03:03,960 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-03 04:03:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -822688907, now seen corresponding path program 1 times [2022-11-03 04:03:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:03:03,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526434261] [2022-11-03 04:03:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:03,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:03:03,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:03:03,962 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:03:03,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-03 04:03:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:04,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 04:03:04,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:04,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:03:04,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:13,133 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-03 04:03:13,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:15,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:20,404 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-03 04:03:20,404 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:03:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526434261] [2022-11-03 04:03:20,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526434261] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2036738556] [2022-11-03 04:03:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:20,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:03:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:03:20,405 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:03:20,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-03 04:03:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:20,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 04:03:20,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:21,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:03:22,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:30,112 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-03 04:03:30,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:30,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:30,948 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-03 04:03:30,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2036738556] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:30,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046191423] [2022-11-03 04:03:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:30,950 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:30,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 04:03:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:31,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 04:03:31,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:31,167 INFO L356 Elim1Store]: treesize reduction 15, result has 31.8 percent of original size [2022-11-03 04:03:31,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:31,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:03:32,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:32,346 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:03:32,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:34,586 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-03 04:03:34,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:35,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:36,341 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-03 04:03:36,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046191423] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:36,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 04:03:36,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 9] total 28 [2022-11-03 04:03:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996094373] [2022-11-03 04:03:36,342 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 04:03:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:03:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 04:03:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=686, Unknown=9, NotChecked=0, Total=812 [2022-11-03 04:03:36,344 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand has 29 states, 28 states have (on average 4.785714285714286) internal successors, (134), 29 states have internal predecessors, (134), 0 states have call successors, (0), 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-03 04:03:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:37,561 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2022-11-03 04:03:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 04:03:37,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.785714285714286) internal successors, (134), 29 states have internal predecessors, (134), 0 states have call successors, (0), 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-03 04:03:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:37,563 INFO L225 Difference]: With dead ends: 212 [2022-11-03 04:03:37,563 INFO L226 Difference]: Without dead ends: 210 [2022-11-03 04:03:37,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 154 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=152, Invalid=895, Unknown=9, NotChecked=0, Total=1056 [2022-11-03 04:03:37,564 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 18 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:37,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 471 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 133 Unchecked, 0.5s Time] [2022-11-03 04:03:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-03 04:03:37,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2022-11-03 04:03:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 190 states have (on average 1.231578947368421) internal successors, (234), 207 states have internal predecessors, (234), 0 states have call successors, (0), 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-03 04:03:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2022-11-03 04:03:37,570 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 32 [2022-11-03 04:03:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:37,570 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2022-11-03 04:03:37,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.785714285714286) internal successors, (134), 29 states have internal predecessors, (134), 0 states have call successors, (0), 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-03 04:03:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2022-11-03 04:03:37,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:03:37,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:37,572 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-03 04:03:37,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:37,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-11-03 04:03:37,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:38,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:38,176 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-03 04:03:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -822688903, now seen corresponding path program 1 times [2022-11-03 04:03:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:03:38,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048330094] [2022-11-03 04:03:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:38,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:03:38,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:03:38,178 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:03:38,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-03 04:03:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:38,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 04:03:38,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:38,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:38,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:38,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:38,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:39,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:39,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:39,075 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:03:39,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 34 [2022-11-03 04:03:39,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:39,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:39,168 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:03:39,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 34 [2022-11-03 04:03:39,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:39,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 25 [2022-11-03 04:03:39,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:39,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:41,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:41,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:03:41,269 INFO L356 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-11-03 04:03:41,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:41,284 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:03:41,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:41,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:41,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:03:41,577 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-03 04:03:41,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:03,245 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-03 04:04:03,245 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:04:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048330094] [2022-11-03 04:04:03,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048330094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1546996063] [2022-11-03 04:04:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:03,246 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 04:04:03,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 04:04:03,247 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 04:04:03,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-03 04:04:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:03,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:04:03,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:04,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:04,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-03 04:04:04,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:04,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-03 04:04:05,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:05,148 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:04:05,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 04:04:05,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:05,251 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:04:05,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 04:04:05,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:05,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-03 04:04:05,997 INFO L356 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-03 04:04:05,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:04:06,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:04:06,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:04:09,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:09,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:09,387 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-03 04:04:09,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 65 [2022-11-03 04:04:09,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:09,415 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:04:09,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-11-03 04:04:09,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:09,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-03 04:04:09,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:09,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-03 04:04:09,926 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-03 04:04:09,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:11,969 WARN L833 $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-03 04:04:12,130 WARN L833 $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-03 04:04:12,639 WARN L833 $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-03 04:04:12,876 WARN L833 $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-03 04:04:12,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-03 04:04:14,257 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-03 04:04:14,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1546996063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48889129] [2022-11-03 04:04:14,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:14,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:14,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:14,259 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:14,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-03 04:04:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:14,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 04:04:14,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:15,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:15,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-03 04:04:15,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:15,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-03 04:04:15,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:15,773 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:04:15,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 04:04:15,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:15,869 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:04:15,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 04:04:16,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:04:16,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-03 04:04:16,499 INFO L356 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-03 04:04:16,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 53 [2022-11-03 04:04:16,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-03 04:04:19,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-03 04:04:19,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:19,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 04:04:19,969 INFO L356 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-03 04:04:19,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 71 [2022-11-03 04:04:19,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:19,986 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:04:19,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2022-11-03 04:04:20,020 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:04:20,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:04:20,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-03 04:04:20,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-03 04:04:20,457 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-03 04:04:20,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:20,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-03 04:06:16,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-03 04:06:24,074 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-03 04:06:24,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48889129] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:24,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 04:06:24,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15, 15, 16, 16] total 77 [2022-11-03 04:06:24,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315327375] [2022-11-03 04:06:24,075 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:24,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-03 04:06:24,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:24,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-03 04:06:24,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=4702, Unknown=78, NotChecked=580, Total=5852 [2022-11-03 04:06:24,079 INFO L87 Difference]: Start difference. First operand 208 states and 234 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-03 04:06:24,249 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (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|) .cse12 (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|) .cse12 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (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)))))) (= .cse5 (_ bv0 32)) (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse7 (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 ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse6 (_ bv0 32))) (= (select (select .cse7 (select (select (let ((.cse8 (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 .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| |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) .cse6)) (_ bv0 32)))))) (not (= |c_ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))) (forall ((v_ArrVal_1533 (_ BitVec 32)) (|v_ULTIMATE.start_append_~node~0#1.base_14| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_~node~0#1.base_14| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_~node~0#1.base_14|) (_ bv4 32) .cse5) (_ bv0 32) v_ArrVal_1533)))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_14|))) |v_ULTIMATE.start_append_~node~0#1.base_14|) (_ bv4 32))) (not (bvult |v_ULTIMATE.start_append_~node~0#1.base_14| |c_#StackHeapBarrier|)))) (= .cse10 (_ bv0 32)) (forall ((|v_ULTIMATE.start_append_~node~0#1.base_14| (_ BitVec 32))) (or (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select v_ArrVal_1539 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse11 (_ bv0 32))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_~node~0#1.base_14| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_append_~node~0#1.base_14|) (_ bv4 32) .cse10) (_ bv0 32) v_ArrVal_1534)) |c_ULTIMATE.start_main_~#list~0#1.base| v_ArrVal_1539) |v_ULTIMATE.start_append_~node~0#1.base_14|) (bvadd (_ bv4 32) .cse11)))))) (not (bvult |v_ULTIMATE.start_append_~node~0#1.base_14| |c_#StackHeapBarrier|)))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~pointerToList#1.offset|) (= |c_ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (bvult |c_ULTIMATE.start_append_~node~0#1.base| |#StackHeapBarrier|))) (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~pointerToList#1.base|)))) is different from false [2022-11-03 04:06:33,341 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (not (= |c_ULTIMATE.start_append_~node~0#1.base| (_ bv0 32))) (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)))))) (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~pointerToList#1.offset|) (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)))))) (= (select .cse4 .cse8) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= |c_ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)) (exists ((|#StackHeapBarrier| (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |c_ULTIMATE.start_main_~#list~0#1.base|) (bvult |c_ULTIMATE.start_append_~node~0#1.base| |#StackHeapBarrier|))) (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) (= (select .cse3 .cse8) (_ bv0 32)))) is different from false [2022-11-03 04:06:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:51,731 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2022-11-03 04:06:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 04:06:51,733 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-03 04:06:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:51,734 INFO L225 Difference]: With dead ends: 209 [2022-11-03 04:06:51,734 INFO L226 Difference]: Without dead ends: 192 [2022-11-03 04:06:51,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2753 ImplicationChecksByTransitivity, 181.8s TimeCoverageRelationStatistics Valid=797, Invalid=6621, Unknown=88, NotChecked=1050, Total=8556 [2022-11-03 04:06:51,737 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:51,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1469 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 193 Unchecked, 1.3s Time] [2022-11-03 04:06:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-03 04:06:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2022-11-03 04:06:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.2485549132947977) internal successors, (216), 190 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-03 04:06:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-11-03 04:06:51,742 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 32 [2022-11-03 04:06:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:51,743 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-11-03 04:06:51,743 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-03 04:06:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-11-03 04:06:51,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:06:51,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:51,744 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, 1, 1] [2022-11-03 04:06:51,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:51,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-11-03 04:06:52,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2022-11-03 04:06:52,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:52,349 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-03 04:06:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash 798159371, now seen corresponding path program 1 times [2022-11-03 04:06:52,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:52,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473860217] [2022-11-03 04:06:52,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:52,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:52,351 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:52,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-03 04:06:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:52,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:06:52,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:53,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:53,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-11-03 04:06:53,469 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-03 04:06:53,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:53,469 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:53,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473860217] [2022-11-03 04:06:53,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473860217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:53,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:53,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 04:06:53,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600694506] [2022-11-03 04:06:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:53,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 04:06:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 04:06:53,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:06:53,471 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:53,966 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2022-11-03 04:06:53,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:06:53,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:06:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:53,968 INFO L225 Difference]: With dead ends: 243 [2022-11-03 04:06:53,968 INFO L226 Difference]: Without dead ends: 243 [2022-11-03 04:06:53,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-03 04:06:53,969 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 241 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:53,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 126 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 60 Invalid, 0 Unknown, 75 Unchecked, 0.4s Time] [2022-11-03 04:06:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-03 04:06:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 213. [2022-11-03 04:06:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.2974358974358975) internal successors, (253), 212 states have internal predecessors, (253), 0 states have call successors, (0), 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-03 04:06:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 253 transitions. [2022-11-03 04:06:53,976 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 253 transitions. Word has length 33 [2022-11-03 04:06:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:53,976 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 253 transitions. [2022-11-03 04:06:53,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 253 transitions. [2022-11-03 04:06:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:06:53,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:53,977 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, 1, 1, 1, 1] [2022-11-03 04:06:53,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:54,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:54,194 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-03 04:06:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1557875661, now seen corresponding path program 1 times [2022-11-03 04:06:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:54,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942653497] [2022-11-03 04:06:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:54,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:54,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:54,196 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:54,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-03 04:06:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:54,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:06:54,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:54,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:06:54,954 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:06:54,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 [2022-11-03 04:06:55,091 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-03 04:06:55,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:55,091 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:55,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942653497] [2022-11-03 04:06:55,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942653497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:55,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:55,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 04:06:55,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939811775] [2022-11-03 04:06:55,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:55,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 04:06:55,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 04:06:55,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:06:55,096 INFO L87 Difference]: Start difference. First operand 213 states and 253 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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-03 04:06:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:55,666 INFO L93 Difference]: Finished difference Result 237 states and 276 transitions. [2022-11-03 04:06:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:06:55,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-03 04:06:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:55,671 INFO L225 Difference]: With dead ends: 237 [2022-11-03 04:06:55,671 INFO L226 Difference]: Without dead ends: 237 [2022-11-03 04:06:55,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-03 04:06:55,672 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:55,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 174 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 04:06:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-03 04:06:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 209. [2022-11-03 04:06:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 192 states have (on average 1.28125) internal successors, (246), 208 states have internal predecessors, (246), 0 states have call successors, (0), 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-03 04:06:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2022-11-03 04:06:55,680 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 35 [2022-11-03 04:06:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:55,681 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2022-11-03 04:06:55,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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-03 04:06:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2022-11-03 04:06:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 04:06:55,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:55,682 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, 1, 1, 1, 1] [2022-11-03 04:06:55,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:55,899 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-03 04:06:55,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1995423857, now seen corresponding path program 1 times [2022-11-03 04:06:55,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:55,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004612392] [2022-11-03 04:06:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:55,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:55,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:55,901 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:55,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-03 04:06:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:56,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 04:06:56,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:56,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-03 04:06:56,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:06:56,972 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-03 04:06:56,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-03 04:06:57,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:06:57,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:57,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 23 [2022-11-03 04:06:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:57,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:57,451 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:57,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004612392] [2022-11-03 04:06:57,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004612392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:57,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:57,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 04:06:57,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618263710] [2022-11-03 04:06:57,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:57,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:06:57,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:06:57,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-03 04:06:57,453 INFO L87 Difference]: Start difference. First operand 209 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:59,417 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2022-11-03 04:06:59,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 04:06:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-03 04:06:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:59,419 INFO L225 Difference]: With dead ends: 243 [2022-11-03 04:06:59,419 INFO L226 Difference]: Without dead ends: 243 [2022-11-03 04:06:59,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-11-03 04:06:59,420 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 186 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:59,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 388 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 43 Unchecked, 1.0s Time] [2022-11-03 04:06:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-03 04:06:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2022-11-03 04:06:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 192 states have (on average 1.2708333333333333) internal successors, (244), 208 states have internal predecessors, (244), 0 states have call successors, (0), 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-03 04:06:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 244 transitions. [2022-11-03 04:06:59,426 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 244 transitions. Word has length 36 [2022-11-03 04:06:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:59,427 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 244 transitions. [2022-11-03 04:06:59,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 244 transitions. [2022-11-03 04:06:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 04:06:59,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:59,428 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, 1, 1, 1, 1, 1] [2022-11-03 04:06:59,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:59,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:59,639 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-03 04:06:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1026976127, now seen corresponding path program 1 times [2022-11-03 04:06:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:59,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023620604] [2022-11-03 04:06:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:59,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:59,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:59,642 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:59,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-11-03 04:06:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:59,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 04:06:59,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:59,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:07:00,082 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:07:00,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:00,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:07:00,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:07:00,527 INFO L356 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-03 04:07:00,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 35 [2022-11-03 04:07:00,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:01,489 INFO L356 Elim1Store]: treesize reduction 19, result has 50.0 percent of original size [2022-11-03 04:07:01,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 30 [2022-11-03 04:07:01,726 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-03 04:07:01,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 39 [2022-11-03 04:07:01,894 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-03 04:07:01,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:07:01,894 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:07:01,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023620604] [2022-11-03 04:07:01,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023620604] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:01,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:01,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-03 04:07:01,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584219904] [2022-11-03 04:07:01,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:01,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 04:07:01,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:07:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 04:07:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-03 04:07:01,896 INFO L87 Difference]: Start difference. First operand 209 states and 244 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:04,093 INFO L93 Difference]: Finished difference Result 218 states and 250 transitions. [2022-11-03 04:07:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 04:07:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-03 04:07:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:04,096 INFO L225 Difference]: With dead ends: 218 [2022-11-03 04:07:04,096 INFO L226 Difference]: Without dead ends: 218 [2022-11-03 04:07:04,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=98, Invalid=363, Unknown=1, NotChecked=0, Total=462 [2022-11-03 04:07:04,096 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 93 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:04,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 437 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 236 Invalid, 0 Unknown, 177 Unchecked, 1.1s Time] [2022-11-03 04:07:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-03 04:07:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2022-11-03 04:07:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 195 states have (on average 1.2666666666666666) internal successors, (247), 211 states have internal predecessors, (247), 0 states have call successors, (0), 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-03 04:07:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 247 transitions. [2022-11-03 04:07:04,102 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 247 transitions. Word has length 36 [2022-11-03 04:07:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:04,102 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 247 transitions. [2022-11-03 04:07:04,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2022-11-03 04:07:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 04:07:04,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:04,104 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, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:04,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:04,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:07:04,321 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-03 04:07:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1771489038, now seen corresponding path program 1 times [2022-11-03 04:07:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:07:04,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218569817] [2022-11-03 04:07:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:04,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:07:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:07:04,322 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:07:04,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-11-03 04:07:04,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:04,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 04:07:04,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:05,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:07:05,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:07:05,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:05,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-03 04:07:05,671 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 04:07:05,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 20 [2022-11-03 04:07:05,861 INFO L356 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-03 04:07:05,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2022-11-03 04:07:05,936 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-03 04:07:05,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:07:05,937 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:07:05,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218569817] [2022-11-03 04:07:05,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218569817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:05,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:05,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 04:07:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824489484] [2022-11-03 04:07:05,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:05,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 04:07:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:07:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 04:07:05,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-03 04:07:05,939 INFO L87 Difference]: Start difference. First operand 212 states and 247 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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-03 04:07:08,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:08,093 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2022-11-03 04:07:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:07:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-11-03 04:07:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:08,096 INFO L225 Difference]: With dead ends: 224 [2022-11-03 04:07:08,096 INFO L226 Difference]: Without dead ends: 224 [2022-11-03 04:07:08,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-11-03 04:07:08,097 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 203 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:08,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 331 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 222 Invalid, 0 Unknown, 52 Unchecked, 1.1s Time] [2022-11-03 04:07:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-03 04:07:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2022-11-03 04:07:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 213 states have internal predecessors, (250), 0 states have call successors, (0), 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-03 04:07:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-11-03 04:07:08,103 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 37 [2022-11-03 04:07:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:08,104 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-11-03 04:07:08,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 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-03 04:07:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-11-03 04:07:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 04:07:08,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:08,105 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, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:08,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:08,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:07:08,322 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-03 04:07:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1825070928, now seen corresponding path program 1 times [2022-11-03 04:07:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:07:08,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49025243] [2022-11-03 04:07:08,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:08,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:07:08,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:07:08,324 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:07:08,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-03 04:07:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:08,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:07:08,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:08,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-11-03 04:07:08,718 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:07:08,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 04:07:09,001 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 04:07:09,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:09,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-03 04:07:09,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-03 04:07:09,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 04:07:09,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 [2022-11-03 04:07:10,816 INFO L356 Elim1Store]: treesize reduction 27, result has 34.1 percent of original size [2022-11-03 04:07:10,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 35 [2022-11-03 04:07:11,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:11,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:11,202 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-03 04:07:11,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:07:11,202 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:07:11,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49025243] [2022-11-03 04:07:11,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49025243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:11,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:11,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-03 04:07:11,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27944683] [2022-11-03 04:07:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:11,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 04:07:11,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:07:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 04:07:11,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-03 04:07:11,205 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 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-03 04:07:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:14,677 INFO L93 Difference]: Finished difference Result 221 states and 253 transitions. [2022-11-03 04:07:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 04:07:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-11-03 04:07:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:14,679 INFO L225 Difference]: With dead ends: 221 [2022-11-03 04:07:14,679 INFO L226 Difference]: Without dead ends: 221 [2022-11-03 04:07:14,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-11-03 04:07:14,680 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 120 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:14,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 352 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 292 Invalid, 0 Unknown, 111 Unchecked, 1.3s Time] [2022-11-03 04:07:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-11-03 04:07:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 214. [2022-11-03 04:07:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 197 states have (on average 1.263959390862944) internal successors, (249), 213 states have internal predecessors, (249), 0 states have call successors, (0), 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-03 04:07:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 249 transitions. [2022-11-03 04:07:14,686 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 249 transitions. Word has length 37 [2022-11-03 04:07:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:14,686 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 249 transitions. [2022-11-03 04:07:14,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.3125) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 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-03 04:07:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 249 transitions. [2022-11-03 04:07:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-03 04:07:14,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:14,688 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:14,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:14,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:07:14,905 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-03 04:07:14,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:14,905 INFO L85 PathProgramCache]: Analyzing trace with hash -220546803, now seen corresponding path program 3 times [2022-11-03 04:07:14,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:07:14,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387411614] [2022-11-03 04:07:14,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:14,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:07:14,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:07:14,906 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:07:14,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b843638-9a26-4632-8ade-2d441bf6498e/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-11-03 04:07:16,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-03 04:07:16,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:16,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:07:16,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:16,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 04:07:16,121 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 04:07:16,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:16,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:16,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:16,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 04:07:16,531 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:07:16,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:16,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:16,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:16,941 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:07:16,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:17,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:17,335 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:07:17,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:17,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:17,777 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:07:17,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:18,218 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 04:07:18,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:18,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:18,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:18,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 04:07:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:18,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:19,445 WARN L833 $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_2015 (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_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (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_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2022-11-03 04:07:19,515 WARN L833 $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_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2015) |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_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-03 04:07:20,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse5 (bvadd (_ bv4 32) .cse1 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (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_2014) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2013))) (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_2014) .cse3 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (not (bvule (bvadd .cse1 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse5)) (not (bvule .cse5 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (not (bvslt (bvadd |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (_ bv20 32)))))) is different from false [2022-11-03 04:07:20,793 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse0 (bvadd (_ bv4 32) .cse4 .cse7))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (and (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2013))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2014) .cse2 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2014) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse6 .cse4) (bvadd .cse6 .cse4 (_ bv12 32)))))) (not (bvslt (bvadd |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (_ bv20 32))) (not (bvule (bvadd .cse4 .cse7) .cse0)))))) is different from false [2022-11-03 04:07:21,126 WARN L833 $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|)) (.cse7 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse6 (bvadd (_ bv8 32) .cse1 .cse7))) (or (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (and (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2014) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2013))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2014) .cse4 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) (not (bvule .cse6 (select |c_#length| .cse2))) (not (bvule (bvadd (_ bv4 32) .cse1 .cse7) .cse6)))))) is different from false [2022-11-03 04:07:21,671 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse15 (bvadd (_ bv4 32) .cse1 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2011))) (let ((.cse0 (select (select .cse3 |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_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2012))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_2013))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store .cse3 .cse4 v_ArrVal_2014) .cse5 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) .cse1) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))) (not (bvule .cse2 (select |c_#length| .cse4)))))))))))) (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2011))) (let ((.cse14 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse9 (bvadd (_ bv8 32) .cse14 .cse1))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2012))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (not (bvule .cse9 (select |c_#length| .cse10))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select (select (store (store .cse12 .cse10 v_ArrVal_2014) (select (select (store .cse13 .cse10 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse11 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse11 .cse1)))))))) (not (bvule (bvadd (_ bv4 32) .cse14 .cse1) .cse9))))))))) (not (bvule (bvadd .cse1 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse15)) (not (bvule .cse15 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32)))))) is different from false [2022-11-03 04:07:22,014 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (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|)) (.cse17 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)) (.cse0 (bvadd (_ bv4 32) .cse2 .cse17))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (and (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2011))) (let ((.cse10 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse9 (bvadd (_ bv8 32) .cse2 .cse10))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2012))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_2013))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (_ bv16 32) .cse2 (select (select (store (store .cse3 .cse4 v_ArrVal_2014) .cse5 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))) (not (bvule .cse9 (select |c_#length| .cse4))))))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse10) .cse9))))))) (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2011))) (let ((.cse16 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse11 (bvadd (_ bv8 32) .cse2 .cse16))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2012))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (or (not (bvule .cse11 (select |c_#length| .cse12))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select (store (store .cse14 .cse12 v_ArrVal_2014) (select (select (store .cse15 .cse12 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd .cse2 .cse13 (_ bv12 32)) (bvadd (_ bv16 32) .cse2 .cse13)))))))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse16) .cse11)))))))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule (bvadd .cse2 .cse17) .cse0)))))) is different from false [2022-11-03 04:07:22,656 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (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|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse0 (bvadd (_ bv8 32) .cse2 .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse3) .cse0)) (and (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2011))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse4 (bvadd .cse2 .cse10 (_ bv12 32)))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2012))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse4 (select |c_#length| .cse5))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store (store .cse7 .cse5 v_ArrVal_2014) (select (select (store .cse8 .cse5 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd (_ bv16 32) .cse2 .cse6) (bvadd .cse2 (_ bv20 32) .cse6)))))))) (not (bvule (bvadd (_ bv8 32) .cse2 .cse10) .cse4))))))) (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2011))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse12 (bvadd .cse2 .cse11 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse2 .cse11) .cse12)) (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2012))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (or (not (bvule .cse12 (select |c_#length| .cse13))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store .cse17 .cse13 v_ArrVal_2013))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd .cse2 (_ bv20 32) (select (select (store (store .cse14 .cse13 v_ArrVal_2014) .cse15 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9)) (select |c_#length| (select (select (store .cse16 .cse15 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9)))))))))))))))))))) is different from false [2022-11-03 04:07:23,910 WARN L833 $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|))) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (let ((.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2010))) (let ((.cse2 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse3 (bvadd (_ bv8 32) .cse0 .cse2))) (or (not (bvule (bvadd (_ bv4 32) .cse0 .cse2) .cse3)) (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2009))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse13 .cse12 v_ArrVal_2011))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse5 (bvadd .cse4 .cse0 (_ bv12 32)))) (or (not (bvule (bvadd .cse4 (_ bv8 32) .cse0) .cse5)) (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store .cse11 .cse12 v_ArrVal_2012))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store (store .cse7 .cse8 v_ArrVal_2014) (select (select (store .cse9 .cse8 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd (_ bv16 32) .cse6 .cse0) (bvadd .cse6 .cse0 (_ bv20 32))))) (not (bvule .cse5 (select |c_#length| .cse8)))))))))))) (not (bvule .cse3 (select |c_#length| .cse12)))))))))))) (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2010))) (let ((.cse25 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse24 (bvadd (_ bv8 32) .cse0 .cse25))) (or (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_2009))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store .cse23 .cse22 v_ArrVal_2011))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse15 (bvadd .cse14 .cse0 (_ bv12 32)))) (or (not (bvule (bvadd .cse14 (_ bv8 32) .cse0) .cse15)) (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse20 (store .cse21 .cse22 v_ArrVal_2012))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_2013))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd (select (select (store (store .cse16 .cse17 v_ArrVal_2014) .cse18 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) .cse0 (_ bv20 32)) (select |c_#length| (select (select (store .cse19 .cse18 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10)))))) (not (bvule .cse15 (select |c_#length| .cse17)))))))))))) (not (bvule .cse24 (select |c_#length| .cse22))))))) (not (bvule (bvadd (_ bv4 32) .cse0 .cse25) .cse24)))))))))))) is different from false [2022-11-03 04:07:24,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (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|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse0 (bvadd (_ bv4 32) .cse2 .cse3)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (not (bvule (bvadd .cse2 .cse3) .cse0)) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (and (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2010))) (let ((.cse4 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse5 (bvadd (_ bv8 32) .cse2 .cse4))) (or (not (bvule (bvadd (_ bv4 32) .cse2 .cse4) .cse5)) (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2009))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store .cse16 .cse14 v_ArrVal_2011))) (let ((.cse15 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse6 (bvadd .cse15 .cse2 (_ bv12 32)))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store .cse13 .cse14 v_ArrVal_2012))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse6 (select |c_#length| .cse7))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_2013))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd .cse2 (select (select (store (store .cse8 .cse7 v_ArrVal_2014) .cse9 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) (_ bv20 32)) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10)))))))))) (not (bvule (bvadd .cse15 (_ bv8 32) .cse2) .cse6))))))) (not (bvule .cse5 (select |c_#length| .cse14)))))))))))) (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2010))) (let ((.cse17 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse18 (bvadd (_ bv8 32) .cse2 .cse17))) (or (not (bvule (bvadd (_ bv4 32) .cse2 .cse17) .cse18)) (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2009))) (let ((.cse25 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store .cse27 .cse25 v_ArrVal_2011))) (let ((.cse26 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse19 (bvadd .cse26 .cse2 (_ bv12 32)))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store .cse24 .cse25 v_ArrVal_2012))) (let ((.cse20 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse19 (select |c_#length| .cse20))) (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (select (select (store (store .cse22 .cse20 v_ArrVal_2014) (select (select (store .cse23 .cse20 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd (_ bv16 32) .cse2 .cse21) (bvadd .cse2 .cse21 (_ bv20 32))))))))) (not (bvule (bvadd .cse26 (_ bv8 32) .cse2) .cse19))))))) (not (bvule .cse18 (select |c_#length| .cse25))))))))))))))))) is different from false [2022-11-03 04:07:25,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (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|)) (.cse27 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10)) (.cse0 (bvadd (_ bv8 32) .cse2 .cse27))) (or (not (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule .cse0 (select |c_#length| .cse1))) (and (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2010))) (let ((.cse3 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse4 (bvadd .cse2 .cse3 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse2 .cse3) .cse4)) (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2009))) (let ((.cse5 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse4 (select |c_#length| .cse5))) (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse14 .cse5 v_ArrVal_2011))) (let ((.cse13 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse11 (bvadd (_ bv16 32) .cse13 .cse2))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store .cse12 .cse5 v_ArrVal_2012))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (store (store .cse7 .cse8 v_ArrVal_2014) (select (select (store .cse9 .cse8 v_ArrVal_2013) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd .cse2 .cse6 (_ bv20 32)) (bvadd .cse2 .cse6 (_ bv24 32))))) (not (bvule .cse11 (select |c_#length| .cse8))))))) (not (bvule (bvadd .cse13 .cse2 (_ bv12 32)) .cse11)))))))))))))))) (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2010))) (let ((.cse15 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse16 (bvadd .cse2 .cse15 (_ bv12 32)))) (or (not (bvule (bvadd (_ bv8 32) .cse2 .cse15) .cse16)) (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2009))) (let ((.cse17 (select (select .cse24 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse16 (select |c_#length| .cse17))) (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store .cse26 .cse17 v_ArrVal_2011))) (let ((.cse25 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse23 (bvadd (_ bv16 32) .cse25 .cse2))) (or (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store .cse24 .cse17 v_ArrVal_2012))) (let ((.cse19 (select (select .cse22 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2016 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store .cse22 .cse19 v_ArrVal_2013))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd .cse2 (select (select (store (store .cse18 .cse19 v_ArrVal_2014) .cse20 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) (_ bv24 32)) (select |c_#length| (select (select (store .cse21 .cse20 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10)))))) (not (bvule .cse23 (select |c_#length| .cse19))))))) (not (bvule (bvadd .cse25 .cse2 (_ bv12 32)) .cse23))))))))))))))))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse27) .cse0)))))) is different from false [2022-11-03 04:07:53,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:53,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1334 treesize of output 1234 [2022-11-03 04:07:54,104 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:54,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1198 treesize of output 718 [2022-11-03 04:07:54,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 141852 treesize of output 124884 [2022-11-03 04:07:59,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 131097462 treesize of output 129217284 [2022-11-03 04:13:33,007 WARN L234 SmtUtils]: Spent 5.55m on a formula simplification that was a NOOP. DAG size: 21260 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)