./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/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_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur --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-38b53e6 [2022-11-25 22:13:19,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:13:19,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:13:19,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:13:19,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:13:19,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:13:19,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:13:19,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:13:19,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:13:19,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:13:19,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:13:19,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:13:19,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:13:19,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:13:19,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:13:19,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:13:19,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:13:19,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:13:19,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:13:19,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:13:19,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:13:19,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:13:19,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:13:19,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:13:19,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:13:19,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:13:19,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:13:19,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:13:19,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:13:19,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:13:19,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:13:19,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:13:19,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:13:19,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:13:19,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:13:19,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:13:19,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:13:19,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:13:19,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:13:19,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:13:19,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:13:19,805 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 22:13:19,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:13:19,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:13:19,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:13:19,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:13:19,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:13:19,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:13:19,847 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:13:19,848 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:13:19,848 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:13:19,848 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:13:19,848 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:13:19,848 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:13:19,849 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:13:19,849 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:13:19,849 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:13:19,849 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:13:19,849 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:13:19,850 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:13:19,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:13:19,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:13:19,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:13:19,851 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:13:19,851 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:13:19,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:13:19,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:13:19,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:13:19,852 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:13:19,853 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:13:19,853 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:13:19,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:13:19,853 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:13:19,853 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:13:19,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:13:19,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:13:19,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:13:19,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:13:19,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:13:19,855 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:13:19,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:13:19,856 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:13:19,856 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:13:19,856 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:13:19,857 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_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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-25 22:13:20,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:13:20,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:13:20,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:13:20,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:13:20,213 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:13:20,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-25 22:13:23,273 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:13:23,507 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:13:23,507 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-25 22:13:23,533 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data/b02232cb8/fb557d039e714f4db46d777ae0dcbb01/FLAG5bfe7a83b [2022-11-25 22:13:23,548 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data/b02232cb8/fb557d039e714f4db46d777ae0dcbb01 [2022-11-25 22:13:23,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:13:23,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:13:23,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:13:23,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:13:23,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:13:23,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:13:23" (1/1) ... [2022-11-25 22:13:23,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ac3de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:23, skipping insertion in model container [2022-11-25 22:13:23,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:13:23" (1/1) ... [2022-11-25 22:13:23,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:13:23,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:13:24,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:13:24,036 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-25 22:13:24,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@797bae88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:24, skipping insertion in model container [2022-11-25 22:13:24,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:13:24,038 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-25 22:13:24,040 INFO L158 Benchmark]: Toolchain (without parser) took 487.07ms. Allocated memory is still 140.5MB. Free memory was 95.0MB in the beginning and 83.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:13:24,041 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 102.8MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:13:24,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.66ms. Allocated memory is still 140.5MB. Free memory was 95.0MB in the beginning and 83.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:13:24,043 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.25ms. Allocated memory is still 102.8MB. Free memory is still 51.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.66ms. Allocated memory is still 140.5MB. Free memory was 95.0MB in the beginning and 83.3MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/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_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur --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-38b53e6 [2022-11-25 22:13:26,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:13:26,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:13:26,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:13:26,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:13:26,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:13:26,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:13:26,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:13:26,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:13:26,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:13:26,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:13:26,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:13:26,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:13:26,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:13:26,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:13:26,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:13:26,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:13:26,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:13:26,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:13:26,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:13:26,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:13:26,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:13:26,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:13:26,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:13:26,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:13:26,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:13:26,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:13:26,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:13:26,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:13:26,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:13:26,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:13:26,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:13:26,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:13:26,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:13:26,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:13:26,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:13:26,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:13:26,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:13:26,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:13:26,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:13:26,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:13:26,520 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 22:13:26,567 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:13:26,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:13:26,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:13:26,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:13:26,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:13:26,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:13:26,570 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:13:26,570 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:13:26,571 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:13:26,571 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:13:26,572 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:13:26,572 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:13:26,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:13:26,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:13:26,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:13:26,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:13:26,574 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:13:26,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:13:26,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:13:26,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:13:26,575 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:13:26,575 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:13:26,575 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:13:26,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:13:26,576 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:13:26,576 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:13:26,576 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:13:26,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:13:26,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:13:26,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:13:26,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:13:26,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:13:26,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:13:26,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:13:26,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:13:26,579 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:13:26,579 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:13:26,579 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:13:26,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:13:26,580 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_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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-25 22:13:26,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:13:27,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:13:27,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:13:27,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:13:27,028 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:13:27,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-25 22:13:30,064 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:13:30,408 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:13:30,409 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2022-11-25 22:13:30,421 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data/1e0301066/c0e5868886974191973ea3f9733ff02b/FLAGb34e13c31 [2022-11-25 22:13:30,441 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/data/1e0301066/c0e5868886974191973ea3f9733ff02b [2022-11-25 22:13:30,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:13:30,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:13:30,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:13:30,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:13:30,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:13:30,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:13:30" (1/1) ... [2022-11-25 22:13:30,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b206980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:30, skipping insertion in model container [2022-11-25 22:13:30,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:13:30" (1/1) ... [2022-11-25 22:13:30,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:13:30,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:13:30,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:13:30,914 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-25 22:13:30,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:13:30,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:13:30,992 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:13:31,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:13:31,106 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:13:31,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31 WrapperNode [2022-11-25 22:13:31,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:13:31,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:13:31,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:13:31,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:13:31,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,156 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-11-25 22:13:31,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:13:31,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:13:31,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:13:31,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:13:31,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:13:31,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:13:31,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:13:31,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:13:31,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (1/1) ... [2022-11-25 22:13:31,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:13:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:13:31,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:13:31,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:13:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:13:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:13:31,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:13:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:13:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:13:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:13:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:13:31,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 22:13:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:13:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:13:31,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:13:31,385 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:13:31,388 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:13:31,930 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:13:31,936 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:13:31,950 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 22:13:31,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:13:31 BoogieIcfgContainer [2022-11-25 22:13:31,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:13:31,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:13:31,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:13:31,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:13:31,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:13:30" (1/3) ... [2022-11-25 22:13:31,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f991c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:13:31, skipping insertion in model container [2022-11-25 22:13:31,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:13:31" (2/3) ... [2022-11-25 22:13:31,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f991c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:13:31, skipping insertion in model container [2022-11-25 22:13:31,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:13:31" (3/3) ... [2022-11-25 22:13:31,961 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2022-11-25 22:13:31,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:13:31,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-25 22:13:32,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:13:32,053 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;@1366ed9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:13:32,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-25 22:13:32,058 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-25 22:13:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:13:32,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:32,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:13:32,066 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-25 22:13:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-11-25 22:13:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:32,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361427819] [2022-11-25 22:13:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:32,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:32,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:32,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:32,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 22:13:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:32,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:13:32,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:32,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:32,401 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:13:32,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:13:32,442 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-25 22:13:32,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:32,446 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:32,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361427819] [2022-11-25 22:13:32,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361427819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:32,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:32,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:13:32,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554956852] [2022-11-25 22:13:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:32,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:13:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:13:32,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:13:32,499 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-25 22:13:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:32,906 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-11-25 22:13:32,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:13:32,911 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-25 22:13:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:32,920 INFO L225 Difference]: With dead ends: 148 [2022-11-25 22:13:32,920 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 22:13:32,921 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-25 22:13:32,925 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.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:32,926 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.3s Time] [2022-11-25 22:13:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 22:13:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2022-11-25 22:13:32,960 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-25 22:13:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-25 22:13:32,963 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2022-11-25 22:13:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:32,964 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-25 22:13:32,964 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-25 22:13:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-25 22:13:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 22:13:32,965 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:32,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 22:13:32,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:33,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:33,166 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-25 22:13:33,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-11-25 22:13:33,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:33,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512572148] [2022-11-25 22:13:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:33,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:33,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:33,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 22:13:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:33,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:13:33,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:33,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:33,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:33,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:13:33,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:13:33,354 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:13:33,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:13:33,374 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-25 22:13:33,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:33,374 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:33,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512572148] [2022-11-25 22:13:33,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512572148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:33,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:33,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:13:33,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853627890] [2022-11-25 22:13:33,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:33,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:13:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:13:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:13:33,379 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-25 22:13:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:33,980 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-11-25 22:13:33,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:13:33,980 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-25 22:13:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:33,982 INFO L225 Difference]: With dead ends: 236 [2022-11-25 22:13:33,982 INFO L226 Difference]: Without dead ends: 236 [2022-11-25 22:13:33,983 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-25 22:13:33,984 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 239 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:33,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 97 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:13:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-25 22:13:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2022-11-25 22:13:33,993 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-25 22:13:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2022-11-25 22:13:33,994 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2022-11-25 22:13:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:33,994 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2022-11-25 22:13:33,995 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-25 22:13:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2022-11-25 22:13:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:13:33,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:33,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:13:34,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:34,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:34,207 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-25 22:13:34,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-11-25 22:13:34,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:34,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541017305] [2022-11-25 22:13:34,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:34,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:34,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 22:13:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:34,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:13:34,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:34,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:34,291 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-25 22:13:34,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:34,292 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:34,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541017305] [2022-11-25 22:13:34,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541017305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:34,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:34,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:13:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147203914] [2022-11-25 22:13:34,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:34,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:13:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:13:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:13:34,295 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-25 22:13:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:34,501 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-11-25 22:13:34,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:13:34,502 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-25 22:13:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:34,503 INFO L225 Difference]: With dead ends: 136 [2022-11-25 22:13:34,503 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 22:13:34,503 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-25 22:13:34,504 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-25 22:13:34,505 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-25 22:13:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 22:13:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-11-25 22:13:34,511 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-25 22:13:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-25 22:13:34,513 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2022-11-25 22:13:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:34,513 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-25 22:13:34,513 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-25 22:13:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-25 22:13:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:13:34,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:34,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:13:34,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:34,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:34,719 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-25 22:13:34,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-11-25 22:13:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339193515] [2022-11-25 22:13:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:34,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:34,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:34,721 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:34,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 22:13:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:34,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:13:34,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:34,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:34,832 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-25 22:13:34,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:34,833 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:34,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339193515] [2022-11-25 22:13:34,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339193515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:34,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:13:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690228474] [2022-11-25 22:13:34,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:34,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:13:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:34,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:13:34,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:13:34,836 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-25 22:13:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:35,146 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-11-25 22:13:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:13:35,147 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-25 22:13:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:35,148 INFO L225 Difference]: With dead ends: 180 [2022-11-25 22:13:35,149 INFO L226 Difference]: Without dead ends: 180 [2022-11-25 22:13:35,149 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-25 22:13:35,150 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-25 22:13:35,151 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-25 22:13:35,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-25 22:13:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2022-11-25 22:13:35,157 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-25 22:13:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-11-25 22:13:35,158 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2022-11-25 22:13:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:35,159 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-11-25 22:13:35,159 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-25 22:13:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-11-25 22:13:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:13:35,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:35,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:35,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:35,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:35,371 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-25 22:13:35,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:35,372 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2022-11-25 22:13:35,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:35,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847694122] [2022-11-25 22:13:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:35,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:35,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:35,374 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:35,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 22:13:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:35,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:13:35,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:35,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:35,488 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:13:35,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:13:35,498 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-25 22:13:35,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:35,498 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:35,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847694122] [2022-11-25 22:13:35,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847694122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:35,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:35,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:13:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283577886] [2022-11-25 22:13:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:35,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:13:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:35,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:13:35,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:13:35,501 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-25 22:13:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:35,718 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-11-25 22:13:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:13:35,718 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-25 22:13:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:35,719 INFO L225 Difference]: With dead ends: 151 [2022-11-25 22:13:35,719 INFO L226 Difference]: Without dead ends: 151 [2022-11-25 22:13:35,719 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-25 22:13:35,720 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-25 22:13:35,721 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-25 22:13:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-25 22:13:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2022-11-25 22:13:35,726 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-25 22:13:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-11-25 22:13:35,727 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2022-11-25 22:13:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:35,727 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-11-25 22:13:35,727 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-25 22:13:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-11-25 22:13:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 22:13:35,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:35,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:35,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:35,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:35,940 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-25 22:13:35,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2022-11-25 22:13:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:35,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115130900] [2022-11-25 22:13:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:35,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:35,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:35,942 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:35,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 22:13:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:36,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:13:36,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:36,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:36,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:36,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:13:36,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 22:13:36,111 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:13:36,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:13:36,125 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-25 22:13:36,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:36,126 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:36,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115130900] [2022-11-25 22:13:36,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115130900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:36,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:36,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:13:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876064564] [2022-11-25 22:13:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:36,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:13:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:36,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:13:36,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:13:36,128 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-25 22:13:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:36,501 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-11-25 22:13:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:13:36,501 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-25 22:13:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:36,502 INFO L225 Difference]: With dead ends: 200 [2022-11-25 22:13:36,502 INFO L226 Difference]: Without dead ends: 200 [2022-11-25 22:13:36,503 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-25 22:13:36,503 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 187 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:36,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 166 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:13:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-25 22:13:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2022-11-25 22:13:36,514 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-25 22:13:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-11-25 22:13:36,519 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2022-11-25 22:13:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:36,520 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-11-25 22:13:36,520 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-25 22:13:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-11-25 22:13:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:13:36,521 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:36,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:36,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:36,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:36,732 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-25 22:13:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2022-11-25 22:13:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:36,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430329197] [2022-11-25 22:13:36,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:36,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:36,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:36,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 22:13:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:36,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 22:13:36,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:36,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:36,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:36,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 22:13:36,930 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-25 22:13:36,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:36,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:36,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430329197] [2022-11-25 22:13:36,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430329197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:36,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:36,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:13:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173667430] [2022-11-25 22:13:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:36,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:13:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:13:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:13:36,933 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-25 22:13:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:37,286 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-11-25 22:13:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:13:37,287 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-25 22:13:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:37,287 INFO L225 Difference]: With dead ends: 109 [2022-11-25 22:13:37,287 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 22:13:37,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:13:37,288 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:37,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 216 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:13:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 22:13:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-11-25 22:13:37,292 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-25 22:13:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-11-25 22:13:37,293 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2022-11-25 22:13:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:37,293 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-11-25 22:13:37,293 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-25 22:13:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-11-25 22:13:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:13:37,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:37,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:37,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:37,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:37,506 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-25 22:13:37,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:37,506 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2022-11-25 22:13:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:37,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489861809] [2022-11-25 22:13:37,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:37,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:37,508 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:37,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 22:13:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:37,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:13:37,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:37,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:37,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:37,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:37,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-11-25 22:13:37,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:13:37,773 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-25 22:13:37,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:37,773 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:37,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489861809] [2022-11-25 22:13:37,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489861809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:37,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:37,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:13:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470453384] [2022-11-25 22:13:37,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:37,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:13:37,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:37,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:13:37,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:13:37,775 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-25 22:13:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:38,209 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-11-25 22:13:38,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:13:38,210 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-25 22:13:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:38,210 INFO L225 Difference]: With dead ends: 104 [2022-11-25 22:13:38,211 INFO L226 Difference]: Without dead ends: 104 [2022-11-25 22:13:38,211 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-25 22:13:38,212 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:38,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 218 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:13:38,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-25 22:13:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-11-25 22:13:38,215 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-25 22:13:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-11-25 22:13:38,216 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2022-11-25 22:13:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:38,216 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-11-25 22:13:38,216 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-25 22:13:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-11-25 22:13:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:13:38,217 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:38,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:38,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:38,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:38,427 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-25 22:13:38,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:38,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2022-11-25 22:13:38,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:38,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885926122] [2022-11-25 22:13:38,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:38,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:38,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:38,428 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:38,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 22:13:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:38,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:13:38,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:38,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:13:38,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:13:38,657 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:13:38,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:13:38,746 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-25 22:13:38,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:38,747 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:38,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885926122] [2022-11-25 22:13:38,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885926122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:38,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:38,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:13:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965123598] [2022-11-25 22:13:38,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:38,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:13:38,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:13:38,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:13:38,749 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-25 22:13:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:39,061 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-11-25 22:13:39,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:13:39,062 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-25 22:13:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:39,062 INFO L225 Difference]: With dead ends: 133 [2022-11-25 22:13:39,063 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 22:13:39,063 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-25 22:13:39,063 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 413 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:39,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 65 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:13:39,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 22:13:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2022-11-25 22:13:39,067 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-25 22:13:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-11-25 22:13:39,067 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2022-11-25 22:13:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:39,068 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-11-25 22:13:39,068 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-25 22:13:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-11-25 22:13:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:13:39,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:39,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:39,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:39,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:39,281 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-25 22:13:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2022-11-25 22:13:39,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:39,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545224775] [2022-11-25 22:13:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:39,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:39,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:39,283 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:39,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 22:13:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:39,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 22:13:39,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:39,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:13:39,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-25 22:13:39,527 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-25 22:13:39,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:39,527 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:39,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545224775] [2022-11-25 22:13:39,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545224775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:39,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:39,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 22:13:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934460914] [2022-11-25 22:13:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:39,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:13:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:39,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:13:39,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:13:39,529 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-25 22:13:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:39,822 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-11-25 22:13:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:13:39,823 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-25 22:13:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:39,824 INFO L225 Difference]: With dead ends: 137 [2022-11-25 22:13:39,824 INFO L226 Difference]: Without dead ends: 137 [2022-11-25 22:13:39,824 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-25 22:13:39,825 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 168 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:39,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:13:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-25 22:13:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2022-11-25 22:13:39,828 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-25 22:13:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-25 22:13:39,828 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2022-11-25 22:13:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:39,828 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-25 22:13:39,829 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-25 22:13:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-25 22:13:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:13:39,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:39,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:39,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:40,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:40,041 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-25 22:13:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2022-11-25 22:13:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:40,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147130275] [2022-11-25 22:13:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:40,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:40,043 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:40,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 22:13:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:40,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 22:13:40,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:40,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:40,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:13:40,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:13:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:13:40,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:40,320 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:40,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147130275] [2022-11-25 22:13:40,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147130275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:40,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:40,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:13:40,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084379386] [2022-11-25 22:13:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:40,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:13:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:40,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:13:40,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:13:40,322 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-25 22:13:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:40,741 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-11-25 22:13:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:13:40,741 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-25 22:13:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:40,742 INFO L225 Difference]: With dead ends: 129 [2022-11-25 22:13:40,742 INFO L226 Difference]: Without dead ends: 129 [2022-11-25 22:13:40,742 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-25 22:13:40,743 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:40,743 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-25 22:13:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-25 22:13:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2022-11-25 22:13:40,746 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-25 22:13:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-11-25 22:13:40,746 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2022-11-25 22:13:40,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:40,746 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-11-25 22:13:40,747 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-25 22:13:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-11-25 22:13:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:13:40,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:40,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:40,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:40,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:40,948 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-25 22:13:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:40,948 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2022-11-25 22:13:40,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:40,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539212050] [2022-11-25 22:13:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:40,950 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:40,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 22:13:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:41,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 22:13:41,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:41,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:41,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:13:41,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:13:41,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 22:13:41,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:13:41,312 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-25 22:13:41,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:13:41,312 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539212050] [2022-11-25 22:13:41,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539212050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:13:41,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:13:41,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:13:41,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546784721] [2022-11-25 22:13:41,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:13:41,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:13:41,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:41,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:13:41,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:13:41,314 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-25 22:13:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:41,892 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-11-25 22:13:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:13:41,893 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-25 22:13:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:41,894 INFO L225 Difference]: With dead ends: 201 [2022-11-25 22:13:41,894 INFO L226 Difference]: Without dead ends: 201 [2022-11-25 22:13:41,895 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-25 22:13:41,895 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:41,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 221 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:13:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-25 22:13:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2022-11-25 22:13:41,898 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-25 22:13:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-11-25 22:13:41,899 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2022-11-25 22:13:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:41,899 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-11-25 22:13:41,899 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-25 22:13:41,899 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-11-25 22:13:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:13:41,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:41,900 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:41,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:42,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:42,100 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-25 22:13:42,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2022-11-25 22:13:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:42,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109859698] [2022-11-25 22:13:42,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:42,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:42,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:42,103 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:42,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 22:13:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:42,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:13:42,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:42,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:42,282 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:13:42,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:13:42,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:42,445 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:13:42,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:13:42,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:13:42,536 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-25 22:13:42,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:13:42,591 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:13:42,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2022-11-25 22:13:42,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:42,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-25 22:13:42,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-25 22:13:42,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:13:46,735 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-25 22:13:46,735 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:46,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109859698] [2022-11-25 22:13:46,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109859698] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:13:46,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2083030321] [2022-11-25 22:13:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:13:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:13:46,745 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:13:46,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-25 22:13:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:46,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 22:13:46,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:47,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:47,027 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:13:47,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:13:47,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:47,151 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:13:47,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:13:47,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:13:47,222 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-25 22:13:47,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:13:49,322 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_301) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 22:13:49,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:49,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-25 22:13:49,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-25 22:13:49,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:13:49,418 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-25 22:13:49,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2083030321] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:13:49,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696432384] [2022-11-25 22:13:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:49,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:13:49,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:13:49,421 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:13:49,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 22:13:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:49,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:13:49,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:49,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:49,595 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:13:49,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:13:49,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:49,706 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:13:49,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 22:13:49,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-11-25 22:13:49,774 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-25 22:13:49,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:13:51,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:51,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-25 22:13:51,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-25 22:13:51,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:13:51,939 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-25 22:13:51,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696432384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:13:51,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:13:51,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6, 7, 6, 7] total 14 [2022-11-25 22:13:51,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303864211] [2022-11-25 22:13:51,940 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:13:51,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 22:13:51,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:51,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 22:13:51,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=97, Unknown=5, NotChecked=66, Total=210 [2022-11-25 22:13:51,941 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:13:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:13:53,105 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-11-25 22:13:53,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:13:53,106 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 22:13:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:13:53,106 INFO L225 Difference]: With dead ends: 154 [2022-11-25 22:13:53,106 INFO L226 Difference]: Without dead ends: 154 [2022-11-25 22:13:53,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=50, Invalid=113, Unknown=5, NotChecked=72, Total=240 [2022-11-25 22:13:53,107 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 124 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:13:53,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 598 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 385 Invalid, 0 Unknown, 302 Unchecked, 1.0s Time] [2022-11-25 22:13:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-25 22:13:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2022-11-25 22:13:53,110 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-25 22:13:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-11-25 22:13:53,111 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2022-11-25 22:13:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:13:53,111 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-11-25 22:13:53,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:13:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-11-25 22:13:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:13:53,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:13:53,112 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:13:53,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:53,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:53,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 22:13:53,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:13:53,713 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-25 22:13:53,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:13:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2022-11-25 22:13:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:13:53,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768968904] [2022-11-25 22:13:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:53,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:13:53,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:13:53,715 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:13:53,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-25 22:13:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:53,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 22:13:53,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:53,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:53,924 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:13:53,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:13:53,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:53,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:53,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:54,222 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:13:54,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:13:54,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:13:54,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:13:54,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:13:54,420 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-25 22:13:54,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:13:54,906 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_384) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0 .cse2) (bvadd (_ bv8 32) .cse0 .cse2)))))) is different from false [2022-11-25 22:13:54,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_384) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse3) (bvadd (_ bv8 32) .cse0 .cse3))))))) is different from false [2022-11-25 22:13:55,046 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_383 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_383) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_384) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2022-11-25 22:13:55,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:55,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-25 22:13:55,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:55,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-25 22:13:55,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2022-11-25 22:13:55,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2022-11-25 22:13:55,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-25 22:13:55,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-11-25 22:13:55,251 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:55,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-25 22:13:55,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-11-25 22:13:55,495 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-25 22:13:55,496 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:13:55,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768968904] [2022-11-25 22:13:55,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768968904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:13:55,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2074133069] [2022-11-25 22:13:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:55,496 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:13:55,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:13:55,499 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:13:55,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-11-25 22:13:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:55,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 22:13:55,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:55,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:55,842 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:13:55,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:13:55,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:55,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:55,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:56,001 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:13:56,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:13:56,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:13:56,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:13:56,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:13:56,123 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-25 22:13:56,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:13:56,291 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-25 22:13:56,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-25 22:13:56,429 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_427 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_427) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_426) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-25 22:13:56,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:56,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-25 22:13:56,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-11-25 22:13:56,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:56,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-25 22:13:56,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:56,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-25 22:13:56,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:13:56,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-25 22:13:56,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:13:56,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-25 22:13:56,574 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-25 22:13:56,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2074133069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:13:56,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778871184] [2022-11-25 22:13:56,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:13:56,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:13:56,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:13:56,575 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:13:56,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 22:13:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:13:56,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 22:13:56,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:13:56,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:13:56,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:13:56,743 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:13:56,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:13:56,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:56,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:13:56,880 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:13:56,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:13:56,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:13:56,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:13:56,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:13:56,997 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-25 22:13:56,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:13:57,156 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_470) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd .cse2 (_ bv4 32) .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-25 22:13:57,205 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_470) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-25 22:13:57,269 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_470) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_469) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2022-11-25 22:13:57,289 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:57,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-25 22:13:57,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:57,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-25 22:13:57,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2022-11-25 22:13:57,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78 [2022-11-25 22:13:57,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-11-25 22:13:57,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-11-25 22:13:57,485 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:13:57,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-25 22:13:57,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-11-25 22:13:57,650 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-25 22:13:57,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778871184] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:13:57,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:13:57,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9, 8, 9] total 21 [2022-11-25 22:13:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138517219] [2022-11-25 22:13:57,651 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:13:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 22:13:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:13:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 22:13:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=130, Unknown=9, NotChecked=270, Total=462 [2022-11-25 22:13:57,652 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-25 22:14:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:14:02,786 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2022-11-25 22:14:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:14:02,789 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-25 22:14:02,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:14:02,790 INFO L225 Difference]: With dead ends: 160 [2022-11-25 22:14:02,790 INFO L226 Difference]: Without dead ends: 160 [2022-11-25 22:14:02,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 9 IntricatePredicates, 2 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=136, Invalid=397, Unknown=9, NotChecked=450, Total=992 [2022-11-25 22:14:02,791 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 74 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 6 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 891 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:14:02,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 922 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 468 Invalid, 7 Unknown, 891 Unchecked, 2.6s Time] [2022-11-25 22:14:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-25 22:14:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 110. [2022-11-25 22:14:02,795 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-25 22:14:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-11-25 22:14:02,795 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2022-11-25 22:14:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:14:02,796 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-11-25 22:14:02,796 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-25 22:14:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-11-25 22:14:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:14:02,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:14:02,797 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-25 22:14:02,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2022-11-25 22:14:03,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-25 22:14:03,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 22:14:03,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:14:03,400 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-25 22:14:03,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:14:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2022-11-25 22:14:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:14:03,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334969429] [2022-11-25 22:14:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:14:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:14:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:14:03,403 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:14:03,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-25 22:14:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:14:03,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 22:14:03,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:14:03,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:14:03,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:14:03,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:14:03,718 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-25 22:14:03,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:14:03,718 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:14:03,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334969429] [2022-11-25 22:14:03,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334969429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:14:03,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:14:03,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:14:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460358605] [2022-11-25 22:14:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:14:03,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:14:03,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:14:03,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:14:03,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:14:03,720 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-25 22:14:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:14:04,231 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-11-25 22:14:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:14:04,231 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-25 22:14:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:14:04,232 INFO L225 Difference]: With dead ends: 146 [2022-11-25 22:14:04,232 INFO L226 Difference]: Without dead ends: 146 [2022-11-25 22:14:04,233 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-25 22:14:04,233 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:14:04,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 160 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:14:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-25 22:14:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2022-11-25 22:14:04,237 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-25 22:14:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-11-25 22:14:04,237 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2022-11-25 22:14:04,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:14:04,238 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-11-25 22:14:04,238 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-25 22:14:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-11-25 22:14:04,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 22:14:04,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:14:04,239 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-25 22:14:04,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-11-25 22:14:04,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:14:04,450 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-25 22:14:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:14:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2022-11-25 22:14:04,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:14:04,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831363510] [2022-11-25 22:14:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:14:04,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:14:04,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:14:04,454 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:14:04,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 22:14:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:14:04,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 22:14:04,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:14:04,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:14:04,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:14:04,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:14:04,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:14:04,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-25 22:14:04,851 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-25 22:14:04,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:14:04,851 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:14:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831363510] [2022-11-25 22:14:04,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831363510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:14:04,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:14:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:14:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056356997] [2022-11-25 22:14:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:14:04,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:14:04,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:14:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:14:04,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:14:04,853 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-25 22:14:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:14:05,492 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-11-25 22:14:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:14:05,493 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-25 22:14:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:14:05,493 INFO L225 Difference]: With dead ends: 203 [2022-11-25 22:14:05,494 INFO L226 Difference]: Without dead ends: 203 [2022-11-25 22:14:05,494 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-25 22:14:05,494 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 165 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:14:05,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 187 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:14:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-25 22:14:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2022-11-25 22:14:05,498 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-25 22:14:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-11-25 22:14:05,499 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2022-11-25 22:14:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:14:05,499 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-11-25 22:14:05,499 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-25 22:14:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-11-25 22:14:05,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:14:05,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:14:05,500 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-25 22:14:05,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 22:14:05,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:14:05,712 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-25 22:14:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:14:05,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2022-11-25 22:14:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:14:05,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082415402] [2022-11-25 22:14:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:14:05,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:14:05,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:14:05,714 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:14:05,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 22:14:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:14:05,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 22:14:05,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:14:05,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:14:05,871 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:14:05,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:14:06,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:14:06,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:14:06,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 22:14:06,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:14:06,418 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 22:14:06,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-11-25 22:14:06,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-25 22:14:06,506 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-25 22:14:06,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:14:06,506 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:14:06,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082415402] [2022-11-25 22:14:06,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082415402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:14:06,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:14:06,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:14:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551133937] [2022-11-25 22:14:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:14:06,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 22:14:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:14:06,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 22:14:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:14:06,508 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-25 22:14:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:14:09,391 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2022-11-25 22:14:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 22:14:09,392 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-25 22:14:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:14:09,393 INFO L225 Difference]: With dead ends: 261 [2022-11-25 22:14:09,393 INFO L226 Difference]: Without dead ends: 261 [2022-11-25 22:14:09,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=202, Invalid=554, Unknown=0, NotChecked=0, Total=756 [2022-11-25 22:14:09,394 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 541 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:14:09,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 435 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 22:14:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-11-25 22:14:09,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 128. [2022-11-25 22:14:09,397 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-25 22:14:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-11-25 22:14:09,398 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2022-11-25 22:14:09,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:14:09,398 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-11-25 22:14:09,398 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-25 22:14:09,399 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-11-25 22:14:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:14:09,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:14:09,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:14:09,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-25 22:14:09,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:14:09,609 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-25 22:14:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:14:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2022-11-25 22:14:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:14:09,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210966177] [2022-11-25 22:14:09,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:14:09,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:14:09,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:14:09,613 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:14:09,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-25 22:14:09,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:14:09,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:14:09,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 22:14:09,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:14:09,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:14:09,871 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:14:09,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:14:09,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:14:09,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:14:09,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:14:10,148 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:14:10,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:14:10,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:14:10,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-25 22:14:10,427 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:14:10,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-25 22:14:10,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:14:10,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:14:10,620 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-25 22:14:10,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:14:11,383 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (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|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (.cse0 (bvadd (_ bv4 32) .cse2 .cse5))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (and (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3)))) (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))) (not (bvule (bvadd .cse2 .cse5) .cse0)))))) is different from false [2022-11-25 22:14:13,073 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_610))) (let ((.cse7 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (bvadd (_ bv8 32) .cse0 .cse7))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_611))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store .cse1 .cse2 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (not (bvule .cse5 (select |c_#length| .cse2))))))) (not (bvule (bvadd (_ bv4 32) .cse0 .cse7) .cse5))))))) (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_610))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse11 (bvadd (_ bv8 32) .cse0 .cse12))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_611) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (select (select (store .cse9 .cse10 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse8) (bvadd .cse0 .cse8 (_ bv12 32))))) (not (bvule .cse11 (select |c_#length| .cse10)))))) (not (bvule (bvadd (_ bv4 32) .cse0 .cse12) .cse11)))))))))) is different from false [2022-11-25 22:14:13,334 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_610))) (let ((.cse6 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse0 (bvadd (_ bv8 32) .cse6))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_611) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule .cse0 (select |c_#length| .cse1))) (forall ((v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store .cse3 .cse1 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) (not (bvule (bvadd (_ bv4 32) .cse6) .cse0))))))) (forall ((v_ArrVal_610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_610))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse7 (bvadd (_ bv8 32) .cse11))) (or (forall ((v_ArrVal_611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_611))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (or (not (bvule .cse7 (select |c_#length| .cse8))) (forall ((v_ArrVal_612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse9 .cse8 v_ArrVal_613) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_612) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (not (bvule (bvadd (_ bv4 32) .cse11) .cse7)))))))))) is different from false [2022-11-25 22:14:13,397 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:14:13,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 142 [2022-11-25 22:14:13,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:14:13,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2022-11-25 22:14:13,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 132 [2022-11-25 22:14:13,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 256 [2022-11-25 22:14:13,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 157 [2022-11-25 22:14:13,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 167 [2022-11-25 22:14:13,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 92 [2022-11-25 22:14:13,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:14:13,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 152 [2022-11-25 22:14:13,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:14:13,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 86 [2022-11-25 22:14:13,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 382 [2022-11-25 22:14:13,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1248 treesize of output 1146 [2022-11-25 22:14:13,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 950 [2022-11-25 22:14:14,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 950 treesize of output 870 [2022-11-25 22:14:14,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 982 treesize of output 934 [2022-11-25 22:14:14,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 908 treesize of output 748 [2022-11-25 22:15:01,107 WARN L233 SmtUtils]: Spent 35.22s on a formula simplification. DAG size of input: 113 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:15:01,219 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:01,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 152 [2022-11-25 22:15:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 22:15:01,266 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:15:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210966177] [2022-11-25 22:15:01,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210966177] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:15:01,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1580159767] [2022-11-25 22:15:01,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:15:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:15:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:15:01,271 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:15:01,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-11-25 22:15:01,660 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:15:01,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:15:01,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 22:15:01,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:15:01,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:15:01,694 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:15:01,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:15:01,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:15:01,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:15:01,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:15:01,836 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:15:01,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:15:01,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:15:02,069 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:15:02,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:15:02,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:15:02,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:15:02,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:15:02,177 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-25 22:15:02,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:15:02,307 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2022-11-25 22:15:02,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0 .cse3) (bvadd (_ bv8 32) .cse0 .cse3))))))) is different from false [2022-11-25 22:15:02,423 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse3) (bvadd .cse0 .cse3 (_ bv12 32)))))))) is different from false [2022-11-25 22:15:02,518 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_670))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_671) .cse0 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_671) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd .cse4 (_ bv8 32) .cse2) (bvadd .cse4 .cse2 (_ bv12 32))))))) is different from false [2022-11-25 22:15:02,609 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_670))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_671) .cse1 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_671) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32) .cse3) (bvadd .cse5 .cse3 (_ bv12 32)))))))) is different from false [2022-11-25 22:15:02,691 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_671) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_670))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_671) .cse3 v_ArrVal_672) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_673) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2022-11-25 22:15:02,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:02,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-25 22:15:02,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:02,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-25 22:15:02,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 400 treesize of output 334 [2022-11-25 22:15:02,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 688 treesize of output 634 [2022-11-25 22:15:02,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 630 treesize of output 582 [2022-11-25 22:15:02,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 582 treesize of output 534 [2022-11-25 22:15:02,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 534 treesize of output 430 [2022-11-25 22:15:02,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 430 treesize of output 414 [2022-11-25 22:15:05,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:05,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-25 22:15:05,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:05,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-25 22:15:05,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2022-11-25 22:15:05,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2022-11-25 22:15:05,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86 [2022-11-25 22:15:05,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-11-25 22:15:05,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2022-11-25 22:15:05,930 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-25 22:15:05,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1580159767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:15:05,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250375531] [2022-11-25 22:15:05,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:15:05,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:15:05,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:15:05,931 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:15:05,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-25 22:15:06,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:15:06,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:15:06,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 22:15:06,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:15:06,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:15:06,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:15:06,144 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:15:06,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:15:06,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:15:06,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:15:06,274 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:15:06,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:15:06,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:15:06,416 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:15:06,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:15:06,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:15:06,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:15:06,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:15:06,523 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-25 22:15:06,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:15:06,649 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))))) is different from false [2022-11-25 22:15:06,695 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) (_ bv8 32) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd .cse3 (_ bv8 32) .cse2))))))) is different from false [2022-11-25 22:15:06,776 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))) is different from false [2022-11-25 22:15:07,024 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_731) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_731))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_730) .cse3 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) is different from false [2022-11-25 22:15:07,282 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_731) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_731))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_730) .cse4 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse1 (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) is different from false [2022-11-25 22:15:07,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_730) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_731) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_731))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_730) .cse3 v_ArrVal_733) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_732) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))) is different from false [2022-11-25 22:15:07,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:07,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-11-25 22:15:07,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:07,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-11-25 22:15:07,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 754 treesize of output 640 [2022-11-25 22:15:07,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1360 treesize of output 1258 [2022-11-25 22:15:07,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1254 treesize of output 1158 [2022-11-25 22:15:07,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1158 treesize of output 1062 [2022-11-25 22:15:07,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1062 treesize of output 862 [2022-11-25 22:15:07,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 862 treesize of output 830 [2022-11-25 22:15:20,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:20,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-11-25 22:15:20,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:20,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-11-25 22:15:20,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2022-11-25 22:15:20,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 244 [2022-11-25 22:15:20,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 186 [2022-11-25 22:15:20,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 184 [2022-11-25 22:15:20,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 130 [2022-11-25 22:15:21,439 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-25 22:15:21,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250375531] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:15:21,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:15:21,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10, 12, 10, 12] total 34 [2022-11-25 22:15:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607666380] [2022-11-25 22:15:21,440 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:15:21,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 22:15:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:15:21,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 22:15:21,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=315, Unknown=19, NotChecked=750, Total=1190 [2022-11-25 22:15:21,442 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-25 22:15:37,912 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.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-25 22:15:38,349 WARN L837 $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-25 22:15:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:15:47,190 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2022-11-25 22:15:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 22:15:47,191 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-25 22:15:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:15:47,195 INFO L225 Difference]: With dead ends: 182 [2022-11-25 22:15:47,195 INFO L226 Difference]: Without dead ends: 182 [2022-11-25 22:15:47,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 17 IntricatePredicates, 2 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 53.4s TimeCoverageRelationStatistics Valid=264, Invalid=962, Unknown=32, NotChecked=1394, Total=2652 [2022-11-25 22:15:47,197 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 84 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1668 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:15:47,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1371 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 928 Invalid, 3 Unknown, 1668 Unchecked, 13.0s Time] [2022-11-25 22:15:47,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-25 22:15:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2022-11-25 22:15:47,201 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-25 22:15:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2022-11-25 22:15:47,204 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 23 [2022-11-25 22:15:47,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:15:47,204 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2022-11-25 22:15:47,204 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-25 22:15:47,205 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2022-11-25 22:15:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 22:15:47,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:15:47,209 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-25 22:15:47,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-25 22:15:47,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-11-25 22:15:47,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-25 22:15:47,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:15:47,810 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-25 22:15:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:15:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -543267076, now seen corresponding path program 1 times [2022-11-25 22:15:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:15:47,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844330272] [2022-11-25 22:15:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:15:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:15:47,813 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:15:47,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-25 22:15:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:15:47,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 22:15:47,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:15:48,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:15:48,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:15:48,293 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-25 22:15:48,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:15:48,294 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:15:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844330272] [2022-11-25 22:15:48,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844330272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:15:48,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:15:48,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:15:48,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563257788] [2022-11-25 22:15:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:15:48,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:15:48,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:15:48,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:15:48,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:15:48,296 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-25 22:15:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:15:48,871 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2022-11-25 22:15:48,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:15:48,871 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-25 22:15:48,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:15:48,873 INFO L225 Difference]: With dead ends: 177 [2022-11-25 22:15:48,873 INFO L226 Difference]: Without dead ends: 177 [2022-11-25 22:15:48,873 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-25 22:15:48,874 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 156 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:15:48,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 169 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:15:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-25 22:15:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2022-11-25 22:15:48,877 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-25 22:15:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2022-11-25 22:15:48,878 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 25 [2022-11-25 22:15:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:15:48,879 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2022-11-25 22:15:48,879 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-25 22:15:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2022-11-25 22:15:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 22:15:48,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:15:48,880 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-25 22:15:48,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-25 22:15:49,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:49,083 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-25 22:15:49,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:15:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash 338589996, now seen corresponding path program 1 times [2022-11-25 22:15:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:15:49,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477616013] [2022-11-25 22:15:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:15:49,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:49,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:15:49,085 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:15:49,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-25 22:15:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:15:49,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 22:15:49,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:15:49,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:15:49,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 22:15:49,926 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-25 22:15:49,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:15:49,926 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:15:49,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477616013] [2022-11-25 22:15:49,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477616013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:15:49,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:15:49,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:15:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889079758] [2022-11-25 22:15:49,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:15:49,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:15:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:15:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:15:49,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:15:49,929 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-25 22:15:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:15:50,760 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2022-11-25 22:15:50,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:15:50,761 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-25 22:15:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:15:50,762 INFO L225 Difference]: With dead ends: 178 [2022-11-25 22:15:50,762 INFO L226 Difference]: Without dead ends: 178 [2022-11-25 22:15:50,762 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-25 22:15:50,763 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 151 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:15:50,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 144 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:15:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-25 22:15:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2022-11-25 22:15:50,767 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-25 22:15:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2022-11-25 22:15:50,768 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 26 [2022-11-25 22:15:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:15:50,768 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2022-11-25 22:15:50,768 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-25 22:15:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2022-11-25 22:15:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:15:50,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:15:50,769 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-25 22:15:50,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-25 22:15:50,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:50,981 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-25 22:15:50,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:15:50,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1906355454, now seen corresponding path program 1 times [2022-11-25 22:15:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:15:50,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017061518] [2022-11-25 22:15:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:15:50,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:15:50,983 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:15:50,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-25 22:15:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:15:51,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 22:15:51,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:15:51,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:15:51,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:15:51,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:15:51,497 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-25 22:15:51,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:15:51,497 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:15:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017061518] [2022-11-25 22:15:51,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017061518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:15:51,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:15:51,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:15:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479616665] [2022-11-25 22:15:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:15:51,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:15:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:15:51,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:15:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:15:51,499 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-25 22:15:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:15:52,324 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-11-25 22:15:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:15:52,325 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-25 22:15:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:15:52,326 INFO L225 Difference]: With dead ends: 177 [2022-11-25 22:15:52,326 INFO L226 Difference]: Without dead ends: 177 [2022-11-25 22:15:52,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:15:52,327 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-25 22:15:52,327 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-25 22:15:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-11-25 22:15:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2022-11-25 22:15:52,330 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-25 22:15:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2022-11-25 22:15:52,331 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 27 [2022-11-25 22:15:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:15:52,331 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2022-11-25 22:15:52,331 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-25 22:15:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2022-11-25 22:15:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:15:52,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:15:52,332 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-25 22:15:52,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-25 22:15:52,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:52,539 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-25 22:15:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:15:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823547, now seen corresponding path program 1 times [2022-11-25 22:15:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:15:52,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731536564] [2022-11-25 22:15:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:15:52,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:15:52,541 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:15:52,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-25 22:15:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:15:52,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 22:15:52,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:15:52,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:15:53,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:15:53,593 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:15:53,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-25 22:15:53,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:15:53,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:15:54,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:15:54,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-11-25 22:15:54,205 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-25 22:15:54,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:15:54,205 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:15:54,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731536564] [2022-11-25 22:15:54,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731536564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:15:54,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:15:54,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:15:54,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666858730] [2022-11-25 22:15:54,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:15:54,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:15:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:15:54,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:15:54,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:15:54,207 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-25 22:15:58,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:15:58,318 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-11-25 22:15:58,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 22:15:58,320 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-25 22:15:58,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:15:58,320 INFO L225 Difference]: With dead ends: 191 [2022-11-25 22:15:58,320 INFO L226 Difference]: Without dead ends: 191 [2022-11-25 22:15:58,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-11-25 22:15:58,321 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 291 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:15:58,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 404 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 22:15:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-11-25 22:15:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 164. [2022-11-25 22:15:58,325 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-25 22:15:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2022-11-25 22:15:58,326 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 27 [2022-11-25 22:15:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:15:58,326 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2022-11-25 22:15:58,326 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-25 22:15:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2022-11-25 22:15:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 22:15:58,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:15:58,327 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-25 22:15:58,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-11-25 22:15:58,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:58,535 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-25 22:15:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:15:58,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823546, now seen corresponding path program 1 times [2022-11-25 22:15:58,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:15:58,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376161065] [2022-11-25 22:15:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:15:58,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:15:58,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:15:58,537 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:15:58,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-25 22:15:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:15:58,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 22:15:58,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:15:58,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:15:58,805 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:15:58,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:15:58,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:15:59,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:15:59,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:15:59,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:15:59,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:15:59,984 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-25 22:15:59,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2022-11-25 22:16:00,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-11-25 22:16:00,173 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-25 22:16:00,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:00,174 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:00,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376161065] [2022-11-25 22:16:00,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376161065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:00,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:00,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:16:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832097902] [2022-11-25 22:16:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:00,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:16:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:00,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:16:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:16:00,175 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-25 22:16:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:06,394 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2022-11-25 22:16:06,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 22:16:06,395 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-25 22:16:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:06,396 INFO L225 Difference]: With dead ends: 282 [2022-11-25 22:16:06,396 INFO L226 Difference]: Without dead ends: 282 [2022-11-25 22:16:06,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2022-11-25 22:16:06,397 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 664 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:06,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 445 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-25 22:16:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-25 22:16:06,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 174. [2022-11-25 22:16:06,401 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-25 22:16:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-11-25 22:16:06,402 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 27 [2022-11-25 22:16:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:06,402 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-11-25 22:16:06,402 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-25 22:16:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-11-25 22:16:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 22:16:06,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:06,403 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-25 22:16:06,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-11-25 22:16:06,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:06,616 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-25 22:16:06,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:06,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522897, now seen corresponding path program 1 times [2022-11-25 22:16:06,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:16:06,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553960439] [2022-11-25 22:16:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:16:06,618 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:16:06,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-25 22:16:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:06,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 22:16:06,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:07,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:16:07,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:16:07,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:16:08,215 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:16:08,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2022-11-25 22:16:08,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:16:08,385 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-25 22:16:08,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:08,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:08,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553960439] [2022-11-25 22:16:08,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553960439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:08,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:08,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:16:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505480627] [2022-11-25 22:16:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:08,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:16:08,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:08,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:16:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:16:08,387 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-25 22:16:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:11,905 INFO L93 Difference]: Finished difference Result 198 states and 222 transitions. [2022-11-25 22:16:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 22:16:11,906 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-25 22:16:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:11,907 INFO L225 Difference]: With dead ends: 198 [2022-11-25 22:16:11,907 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 22:16:11,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-11-25 22:16:11,907 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 286 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:11,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 311 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 22:16:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 22:16:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2022-11-25 22:16:11,911 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-25 22:16:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 210 transitions. [2022-11-25 22:16:11,912 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 210 transitions. Word has length 28 [2022-11-25 22:16:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:11,912 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 210 transitions. [2022-11-25 22:16:11,912 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-25 22:16:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2022-11-25 22:16:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 22:16:11,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:11,913 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-25 22:16:11,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:12,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:12,123 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-25 22:16:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522896, now seen corresponding path program 1 times [2022-11-25 22:16:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:16:12,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451547894] [2022-11-25 22:16:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:12,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:12,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:16:12,125 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:16:12,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-25 22:16:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:12,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:16:12,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:12,661 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-25 22:16:12,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:12,661 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:12,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451547894] [2022-11-25 22:16:12,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451547894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:12,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:12,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:16:12,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136597044] [2022-11-25 22:16:12,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:12,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:16:12,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:12,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:16:12,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:16:12,663 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-25 22:16:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:12,887 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2022-11-25 22:16:12,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:16:12,888 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-25 22:16:12,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:12,891 INFO L225 Difference]: With dead ends: 170 [2022-11-25 22:16:12,891 INFO L226 Difference]: Without dead ends: 170 [2022-11-25 22:16:12,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:16:12,892 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 104 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:12,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 49 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 22:16:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-25 22:16:12,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-25 22:16:12,897 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-25 22:16:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2022-11-25 22:16:12,898 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 28 [2022-11-25 22:16:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:12,898 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2022-11-25 22:16:12,898 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-25 22:16:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2022-11-25 22:16:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 22:16:12,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:12,899 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-25 22:16:12,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:13,111 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-25 22:16:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1614814932, now seen corresponding path program 1 times [2022-11-25 22:16:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:16:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765673939] [2022-11-25 22:16:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:13,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:13,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:16:13,113 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:16:13,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-25 22:16:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:13,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:16:13,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:13,489 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-25 22:16:13,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:16:13,775 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-25 22:16:13,775 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:13,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765673939] [2022-11-25 22:16:13,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765673939] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:16:13,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1617144986] [2022-11-25 22:16:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:13,776 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:16:13,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:16:13,779 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:16:13,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-25 22:16:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:14,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:16:14,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:14,183 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-25 22:16:14,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:16:14,301 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-25 22:16:14,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1617144986] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:16:14,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991059545] [2022-11-25 22:16:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:14,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:14,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:14,303 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:14,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-25 22:16:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:14,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:16:14,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:14,578 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-25 22:16:14,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:16:15,039 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-25 22:16:15,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991059545] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:16:15,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:16:15,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 7] total 13 [2022-11-25 22:16:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657525533] [2022-11-25 22:16:15,040 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:16:15,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 22:16:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 22:16:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:16:15,041 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-25 22:16:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:15,901 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2022-11-25 22:16:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:16:15,903 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-25 22:16:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:15,904 INFO L225 Difference]: With dead ends: 253 [2022-11-25 22:16:15,904 INFO L226 Difference]: Without dead ends: 253 [2022-11-25 22:16:15,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-11-25 22:16:15,905 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 209 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:15,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 746 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 22:16:15,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-25 22:16:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 183. [2022-11-25 22:16:15,910 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-25 22:16:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-11-25 22:16:15,910 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 30 [2022-11-25 22:16:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:15,911 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-11-25 22:16:15,911 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-25 22:16:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-11-25 22:16:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 22:16:15,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:15,912 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-25 22:16:15,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:16,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:16,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:16,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:16,523 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-25 22:16:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash -842646633, now seen corresponding path program 1 times [2022-11-25 22:16:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:16:16,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666947868] [2022-11-25 22:16:16,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:16,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:16,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:16:16,524 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:16:16,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-25 22:16:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:16,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 22:16:16,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:16,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:16:16,816 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:16:16,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:16:17,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:16:17,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 22:16:17,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:16:17,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-25 22:16:17,895 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 22:16:17,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-11-25 22:16:18,095 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-25 22:16:18,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:18,096 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:18,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666947868] [2022-11-25 22:16:18,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666947868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:18,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:18,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 22:16:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006815860] [2022-11-25 22:16:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:18,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:16:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:16:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:16:18,098 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-25 22:16:20,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:16:25,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:16:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:28,644 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2022-11-25 22:16:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 22:16:28,646 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-25 22:16:28,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:28,647 INFO L225 Difference]: With dead ends: 284 [2022-11-25 22:16:28,647 INFO L226 Difference]: Without dead ends: 284 [2022-11-25 22:16:28,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=251, Invalid=679, Unknown=0, NotChecked=0, Total=930 [2022-11-25 22:16:28,648 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 617 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:28,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 458 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 644 Invalid, 2 Unknown, 0 Unchecked, 7.9s Time] [2022-11-25 22:16:28,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-11-25 22:16:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 183. [2022-11-25 22:16:28,652 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-25 22:16:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2022-11-25 22:16:28,653 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 30 [2022-11-25 22:16:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:28,653 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2022-11-25 22:16:28,654 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-25 22:16:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2022-11-25 22:16:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 22:16:28,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:28,654 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-25 22:16:28,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:28,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:28,866 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-25 22:16:28,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:28,867 INFO L85 PathProgramCache]: Analyzing trace with hash -842657618, now seen corresponding path program 1 times [2022-11-25 22:16:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:16:28,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178510171] [2022-11-25 22:16:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:28,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:28,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:16:28,869 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:16:28,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-25 22:16:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:29,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:16:29,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:29,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:16:29,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-25 22:16:29,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:29,131 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:29,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178510171] [2022-11-25 22:16:29,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178510171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:29,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:29,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:16:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020047889] [2022-11-25 22:16:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:29,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:16:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:16:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:16:29,132 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-25 22:16:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:29,688 INFO L93 Difference]: Finished difference Result 199 states and 226 transitions. [2022-11-25 22:16:29,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:16:29,689 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-25 22:16:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:29,690 INFO L225 Difference]: With dead ends: 199 [2022-11-25 22:16:29,690 INFO L226 Difference]: Without dead ends: 199 [2022-11-25 22:16:29,691 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-25 22:16:29,691 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 27 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:29,692 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.5s Time] [2022-11-25 22:16:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-11-25 22:16:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 182. [2022-11-25 22:16:29,696 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-25 22:16:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2022-11-25 22:16:29,697 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 30 [2022-11-25 22:16:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:29,697 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2022-11-25 22:16:29,697 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-25 22:16:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2022-11-25 22:16:29,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 22:16:29,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:29,698 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-25 22:16:29,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:29,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:29,911 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-25 22:16:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash -352582234, now seen corresponding path program 1 times [2022-11-25 22:16:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:16:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171573629] [2022-11-25 22:16:29,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:16:29,913 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:16:29,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-11-25 22:16:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:30,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:16:30,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:30,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:16:30,452 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-25 22:16:30,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:16:30,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:30,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171573629] [2022-11-25 22:16:30,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171573629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:16:30,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:16:30,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:16:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129793986] [2022-11-25 22:16:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:16:30,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:16:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:30,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:16:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:16:30,454 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-25 22:16:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:16:31,164 INFO L93 Difference]: Finished difference Result 197 states and 220 transitions. [2022-11-25 22:16:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:16:31,165 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-25 22:16:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:16:31,166 INFO L225 Difference]: With dead ends: 197 [2022-11-25 22:16:31,166 INFO L226 Difference]: Without dead ends: 197 [2022-11-25 22:16:31,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:16:31,167 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 66 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:16:31,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:16:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-25 22:16:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2022-11-25 22:16:31,171 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-25 22:16:31,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 204 transitions. [2022-11-25 22:16:31,171 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 204 transitions. Word has length 31 [2022-11-25 22:16:31,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:16:31,171 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 204 transitions. [2022-11-25 22:16:31,172 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-25 22:16:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 204 transitions. [2022-11-25 22:16:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 22:16:31,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:16:31,172 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-25 22:16:31,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-11-25 22:16:31,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:31,385 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-25 22:16:31,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:16:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash -822688907, now seen corresponding path program 1 times [2022-11-25 22:16:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:16:31,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336979637] [2022-11-25 22:16:31,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:31,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:16:31,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:16:31,387 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:16:31,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-11-25 22:16:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:31,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 22:16:31,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:31,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:16:32,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-25 22:16:40,727 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#list~0#1.base_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ BitVec 32)) (v_ArrVal_1377 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_21| v_ArrVal_1377))) (and (= (store (store .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_21| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9|)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_21|))))) is different from true [2022-11-25 22:16:40,728 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-25 22:16:40,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:16:43,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-11-25 22:16:46,305 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-25 22:16:46,305 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:16:46,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336979637] [2022-11-25 22:16:46,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336979637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:16:46,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [155379869] [2022-11-25 22:16:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:46,306 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:16:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:16:46,307 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:16:46,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-11-25 22:16:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:46,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 22:16:46,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:47,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:16:48,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2022-11-25 22:16:49,320 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~mem21#1.base_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#list~0#1.base_23| (_ BitVec 32)) (v_ArrVal_1413 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_23| v_ArrVal_1413))) (and (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_12| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_23| (_ bv0 1))) (bvult |v_ULTIMATE.start_main_#t~mem21#1.base_12| |#StackHeapBarrier|) (= (select .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_12|) (_ bv0 1)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_23|)) (bvult |#StackHeapBarrier| |v_ULTIMATE.start_main_~#list~0#1.base_23|)))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32)))) is different from true [2022-11-25 22:16:49,321 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-25 22:16:49,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:16:49,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-11-25 22:16:50,309 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-25 22:16:50,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [155379869] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:16:50,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342432137] [2022-11-25 22:16:50,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:16:50,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:16:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:16:50,311 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:16:50,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-25 22:16:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:16:50,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 22:16:50,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:16:50,559 INFO L321 Elim1Store]: treesize reduction 15, result has 31.8 percent of original size [2022-11-25 22:16:50,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 36 [2022-11-25 22:16:51,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:16:51,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-25 22:16:51,830 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:16:51,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 39 [2022-11-25 22:16:54,086 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#list~0#1.base_25| (_ BitVec 32)) (v_ArrVal_1377 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_25| v_ArrVal_1377))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_25|)) (= (store (store .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9| (_ bv0 1)) |v_ULTIMATE.start_main_~#list~0#1.base_25| (_ bv0 1)) |c_#valid|) (= (select .cse0 |v_ULTIMATE.start_main_#t~mem21#1.base_9|) (_ bv0 1))))) is different from true [2022-11-25 22:16:54,086 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-25 22:16:54,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:16:54,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2022-11-25 22:16:57,766 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-25 22:16:57,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342432137] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:16:57,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:16:57,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 9] total 29 [2022-11-25 22:16:57,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247604806] [2022-11-25 22:16:57,767 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:16:57,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 22:16:57,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:16:57,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 22:16:57,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=589, Unknown=10, NotChecked=156, Total=870 [2022-11-25 22:16:57,769 INFO L87 Difference]: Start difference. First operand 180 states and 204 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 30 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:17:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:17:10,101 INFO L93 Difference]: Finished difference Result 289 states and 322 transitions. [2022-11-25 22:17:10,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 22:17:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 30 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 22:17:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:17:10,103 INFO L225 Difference]: With dead ends: 289 [2022-11-25 22:17:10,103 INFO L226 Difference]: Without dead ends: 287 [2022-11-25 22:17:10,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 153 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=339, Invalid=1385, Unknown=10, NotChecked=246, Total=1980 [2022-11-25 22:17:10,103 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 228 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:17:10,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 696 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 703 Invalid, 0 Unknown, 321 Unchecked, 5.4s Time] [2022-11-25 22:17:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-25 22:17:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 208. [2022-11-25 22:17:10,108 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-25 22:17:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 234 transitions. [2022-11-25 22:17:10,109 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 234 transitions. Word has length 32 [2022-11-25 22:17:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:17:10,109 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 234 transitions. [2022-11-25 22:17:10,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 30 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:17:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 234 transitions. [2022-11-25 22:17:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 22:17:10,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:17:10,111 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-25 22:17:10,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-11-25 22:17:10,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-11-25 22:17:10,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-11-25 22:17:10,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:17:10,719 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-25 22:17:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:17:10,720 INFO L85 PathProgramCache]: Analyzing trace with hash -822688903, now seen corresponding path program 1 times [2022-11-25 22:17:10,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:17:10,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280829361] [2022-11-25 22:17:10,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:17:10,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:17:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:17:10,721 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:17:10,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-11-25 22:17:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:17:10,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 22:17:10,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:17:11,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:11,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 22:17:11,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:11,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 22:17:11,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:11,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:11,885 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:17:11,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2022-11-25 22:17:11,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:11,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:12,009 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:17:12,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 34 [2022-11-25 22:17:12,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:17:12,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-25 22:17:12,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:17:12,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-11-25 22:17:14,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:14,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:14,589 INFO L321 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-11-25 22:17:14,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 84 [2022-11-25 22:17:14,606 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:17:14,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 53 [2022-11-25 22:17:14,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 22:17:14,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-11-25 22:17:14,960 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-25 22:17:14,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:17:43,007 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-25 22:17:43,008 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:17:43,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280829361] [2022-11-25 22:17:43,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280829361] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:17:43,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [102435577] [2022-11-25 22:17:43,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:17:43,008 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:17:43,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:17:43,009 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:17:43,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-11-25 22:17:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:17:43,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 22:17:43,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:17:44,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:44,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 22:17:44,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:44,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 22:17:45,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:45,311 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:17:45,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 22:17:45,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:45,412 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:17:45,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 22:17:46,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:46,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-25 22:17:46,172 INFO L321 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-25 22:17:46,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 45 [2022-11-25 22:17:46,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:17:46,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:17:50,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:50,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:50,703 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-25 22:17:50,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 65 [2022-11-25 22:17:50,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:50,731 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:17:50,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 22:17:51,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:51,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 22:17:51,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:51,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 22:17:51,805 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-25 22:17:51,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:17:53,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse0 (_ bv0 32))) (= (select (select .cse1 .cse2) (bvadd (_ bv4 32) .cse0)) (_ bv0 32))))) (forall ((v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse3 (_ bv0 32))) (= (select (select .cse4 .cse2) (bvadd (_ bv4 32) .cse3)) (_ bv0 32))))))))) is different from false [2022-11-25 22:17:54,123 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) (and (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse0 (_ bv0 32))) (= (select (select .cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse2 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse2 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) .cse0)) (_ bv0 32)))))) (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse5 (_ bv0 32))) (= (_ bv0 32) (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (bvadd (_ bv4 32) .cse5)))))))) is different from false [2022-11-25 22:17:54,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.base|)) (.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.offset|))) (and (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (_ bv0 32) (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) .cse3))) (not (= .cse3 (_ bv0 32))))))) (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse6 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse6 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (bvadd (_ bv4 32) .cse7)) (_ bv0 32)) (not (= .cse7 (_ bv0 32))))))))) is different from false [2022-11-25 22:17:54,922 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (.cse4 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset|)))) (and (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (bvadd (_ bv4 32) .cse3)) (_ bv0 32)) (not (= .cse3 (_ bv0 32)))))) (forall ((v_ArrVal_1534 (_ BitVec 32)) (v_ArrVal_1539 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1533 (_ BitVec 32))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1534)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1539))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= .cse5 (_ bv0 32))) (= (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| v_ArrVal_1533)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) .cse5)) (_ bv0 32))))))))) is different from false [2022-11-25 22:17:54,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-25 22:17:56,709 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-25 22:17:56,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [102435577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:17:56,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116130910] [2022-11-25 22:17:56,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:17:56,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:17:56,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:17:56,711 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:17:56,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-25 22:17:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:17:56,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 22:17:56,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:17:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:57,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 22:17:57,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:17:57,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 22:17:58,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:58,482 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:17:58,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 22:17:58,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:17:58,604 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:17:58,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 22:17:59,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:17:59,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-11-25 22:17:59,348 INFO L321 Elim1Store]: treesize reduction 18, result has 62.5 percent of original size [2022-11-25 22:17:59,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 55 [2022-11-25 22:17:59,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 22:18:03,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-25 22:18:04,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:18:04,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:18:04,422 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-25 22:18:04,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 71 [2022-11-25 22:18:04,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:18:04,440 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 22:18:04,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2022-11-25 22:18:04,477 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:18:04,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:18:04,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 22:18:05,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 22:18:05,018 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-25 22:18:05,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:18:05,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-11-25 22:18:44,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-25 22:18:49,906 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-25 22:18:49,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116130910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:18:49,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:18:49,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15, 15, 16, 16] total 77 [2022-11-25 22:18:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677851042] [2022-11-25 22:18:49,907 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:18:49,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-25 22:18:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:18:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-25 22:18:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=4728, Unknown=52, NotChecked=580, Total=5852 [2022-11-25 22:18:49,911 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-25 22:18:52,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:18:54,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:18:57,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:19:11,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:19:13,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:19:19,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:19:45,824 WARN L233 SmtUtils]: Spent 21.09s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:19:48,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:20:17,515 WARN L233 SmtUtils]: Spent 13.90s on a formula simplification that was a NOOP. DAG size: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:20:20,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:20:41,623 WARN L233 SmtUtils]: Spent 14.27s on a formula simplification that was a NOOP. DAG size: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:20:43,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:21:03,287 WARN L233 SmtUtils]: Spent 15.08s on a formula simplification that was a NOOP. DAG size: 142 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:21:30,636 WARN L233 SmtUtils]: Spent 17.02s on a formula simplification that was a NOOP. DAG size: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:21:32,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:21:34,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:21:59,044 WARN L233 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:22:02,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 22:22:30,975 WARN L233 SmtUtils]: Spent 16.74s on a formula simplification that was a NOOP. DAG size: 151 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 22:22:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:22:42,540 INFO L93 Difference]: Finished difference Result 215 states and 241 transitions. [2022-11-25 22:22:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 22:22:42,543 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-25 22:22:42,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:22:42,544 INFO L225 Difference]: With dead ends: 215 [2022-11-25 22:22:42,544 INFO L226 Difference]: Without dead ends: 198 [2022-11-25 22:22:42,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2920 ImplicationChecksByTransitivity, 270.7s TimeCoverageRelationStatistics Valid=889, Invalid=7061, Unknown=76, NotChecked=716, Total=8742 [2022-11-25 22:22:42,547 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 131 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 29 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 48.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:22:42,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1950 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1236 Invalid, 16 Unknown, 233 Unchecked, 48.9s Time] [2022-11-25 22:22:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-25 22:22:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2022-11-25 22:22:42,551 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-25 22:22:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-11-25 22:22:42,552 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 32 [2022-11-25 22:22:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:22:42,552 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-11-25 22:22:42,552 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-25 22:22:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-11-25 22:22:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 22:22:42,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:22:42,553 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-25 22:22:42,561 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-11-25 22:22:42,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-11-25 22:22:42,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-11-25 22:22:43,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:43,161 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-25 22:22:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:22:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash 798159371, now seen corresponding path program 1 times [2022-11-25 22:22:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:22:43,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125775889] [2022-11-25 22:22:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:22:43,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:22:43,163 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:22:43,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-11-25 22:22:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:22:43,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:22:43,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:22:44,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:22:44,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:22:44,390 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-25 22:22:44,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:22:44,390 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:22:44,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125775889] [2022-11-25 22:22:44,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125775889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:22:44,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:22:44,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:22:44,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470969766] [2022-11-25 22:22:44,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:22:44,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:22:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:22:44,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:22:44,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:22:44,392 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-25 22:22:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:22:45,274 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2022-11-25 22:22:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:22:45,275 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-25 22:22:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:22:45,276 INFO L225 Difference]: With dead ends: 205 [2022-11-25 22:22:45,276 INFO L226 Difference]: Without dead ends: 205 [2022-11-25 22:22:45,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:22:45,277 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 186 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:22:45,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 72 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 22:22:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-25 22:22:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2022-11-25 22:22:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 175 states have (on average 1.2457142857142858) internal successors, (218), 192 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 218 transitions. [2022-11-25 22:22:45,282 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 218 transitions. Word has length 33 [2022-11-25 22:22:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:22:45,283 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 218 transitions. [2022-11-25 22:22:45,283 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-25 22:22:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 218 transitions. [2022-11-25 22:22:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 22:22:45,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:22:45,284 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-25 22:22:45,297 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-11-25 22:22:45,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:45,491 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-25 22:22:45,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:22:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1557875661, now seen corresponding path program 1 times [2022-11-25 22:22:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:22:45,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088086195] [2022-11-25 22:22:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:22:45,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:45,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:22:45,493 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:22:45,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-25 22:22:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:22:45,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 22:22:45,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:22:46,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:22:46,302 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:22:46,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 24 [2022-11-25 22:22:46,474 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-25 22:22:46,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:22:46,474 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:22:46,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088086195] [2022-11-25 22:22:46,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088086195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:22:46,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:22:46,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:22:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722872504] [2022-11-25 22:22:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:22:46,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:22:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:22:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:22:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:22:46,476 INFO L87 Difference]: Start difference. First operand 193 states and 218 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-25 22:22:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:22:46,852 INFO L93 Difference]: Finished difference Result 217 states and 241 transitions. [2022-11-25 22:22:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 22:22:46,852 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-25 22:22:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:22:46,853 INFO L225 Difference]: With dead ends: 217 [2022-11-25 22:22:46,853 INFO L226 Difference]: Without dead ends: 217 [2022-11-25 22:22:46,853 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-25 22:22:46,854 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:22:46,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 148 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:22:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-25 22:22:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 192. [2022-11-25 22:22:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.2342857142857142) internal successors, (216), 191 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-25 22:22:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2022-11-25 22:22:46,859 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 35 [2022-11-25 22:22:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:22:46,859 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2022-11-25 22:22:46,859 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-25 22:22:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2022-11-25 22:22:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:22:46,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:22:46,860 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-25 22:22:46,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Ended with exit code 0 [2022-11-25 22:22:47,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:47,074 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-25 22:22:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:22:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1995423857, now seen corresponding path program 1 times [2022-11-25 22:22:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:22:47,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416502297] [2022-11-25 22:22:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:22:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:47,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:22:47,077 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:22:47,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-11-25 22:22:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:22:47,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 22:22:47,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:22:48,091 INFO L350 Elim1Store]: Elim1 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-25 22:22:48,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:22:48,319 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-25 22:22:48,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-25 22:22:48,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:22:48,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:22:48,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2022-11-25 22:22:48,911 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-25 22:22:48,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:22:48,911 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:22:48,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416502297] [2022-11-25 22:22:48,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416502297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:22:48,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:22:48,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 22:22:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320495919] [2022-11-25 22:22:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:22:48,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:22:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:22:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:22:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 22:22:48,913 INFO L87 Difference]: Start difference. First operand 192 states and 216 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-25 22:22:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:22:52,182 INFO L93 Difference]: Finished difference Result 271 states and 294 transitions. [2022-11-25 22:22:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 22:22:52,184 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-25 22:22:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:22:52,184 INFO L225 Difference]: With dead ends: 271 [2022-11-25 22:22:52,184 INFO L226 Difference]: Without dead ends: 271 [2022-11-25 22:22:52,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2022-11-25 22:22:52,185 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 452 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:22:52,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 515 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 22:22:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-11-25 22:22:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 192. [2022-11-25 22:22:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.2228571428571429) internal successors, (214), 191 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:22:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 214 transitions. [2022-11-25 22:22:52,190 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 214 transitions. Word has length 36 [2022-11-25 22:22:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:22:52,190 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 214 transitions. [2022-11-25 22:22:52,190 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-25 22:22:52,191 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 214 transitions. [2022-11-25 22:22:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 22:22:52,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:22:52,191 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-25 22:22:52,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Ended with exit code 0 [2022-11-25 22:22:52,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:52,411 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-25 22:22:52,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:22:52,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1026976127, now seen corresponding path program 1 times [2022-11-25 22:22:52,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:22:52,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711146481] [2022-11-25 22:22:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:22:52,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:22:52,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:22:52,413 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:22:52,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-11-25 22:22:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:22:52,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-25 22:22:52,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:22:52,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:22:52,962 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:22:52,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:22:53,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:22:53,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:22:53,507 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-11-25 22:22:53,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2022-11-25 22:22:53,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-11-25 22:22:54,638 INFO L321 Elim1Store]: treesize reduction 19, result has 50.0 percent of original size [2022-11-25 22:22:54,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2022-11-25 22:22:54,911 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-25 22:22:54,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2022-11-25 22:22:55,109 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-25 22:22:55,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:22:55,109 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:22:55,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711146481] [2022-11-25 22:22:55,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711146481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:22:55,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:22:55,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 22:22:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506448263] [2022-11-25 22:22:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:22:55,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 22:22:55,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:22:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 22:22:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=131, Unknown=1, NotChecked=0, Total=156 [2022-11-25 22:22:55,111 INFO L87 Difference]: Start difference. First operand 192 states and 214 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-25 22:23:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:23:00,210 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2022-11-25 22:23:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 22:23:00,212 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-25 22:23:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:23:00,213 INFO L225 Difference]: With dead ends: 247 [2022-11-25 22:23:00,213 INFO L226 Difference]: Without dead ends: 247 [2022-11-25 22:23:00,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=139, Invalid=508, Unknown=3, NotChecked=0, Total=650 [2022-11-25 22:23:00,214 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 274 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:23:00,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 476 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 509 Invalid, 4 Unknown, 0 Unchecked, 3.0s Time] [2022-11-25 22:23:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-11-25 22:23:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 195. [2022-11-25 22:23:00,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 178 states have (on average 1.2191011235955056) internal successors, (217), 194 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:23:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 217 transitions. [2022-11-25 22:23:00,218 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 217 transitions. Word has length 36 [2022-11-25 22:23:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:23:00,219 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 217 transitions. [2022-11-25 22:23:00,219 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-25 22:23:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 217 transitions. [2022-11-25 22:23:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 22:23:00,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:23:00,220 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-25 22:23:00,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-11-25 22:23:00,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:23:00,433 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-25 22:23:00,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:23:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1771489038, now seen corresponding path program 1 times [2022-11-25 22:23:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:23:00,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349101805] [2022-11-25 22:23:00,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:23:00,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:23:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:23:00,435 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:23:00,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-11-25 22:23:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:23:00,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 22:23:00,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:23:01,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:23:01,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:23:01,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:23:01,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-11-25 22:23:02,063 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:23:02,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2022-11-25 22:23:02,307 INFO L321 Elim1Store]: treesize reduction 32, result has 27.3 percent of original size [2022-11-25 22:23:02,307 INFO L350 Elim1Store]: Elim1 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-25 22:23:02,380 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-25 22:23:02,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:23:02,381 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:23:02,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349101805] [2022-11-25 22:23:02,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349101805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:23:02,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:23:02,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 22:23:02,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124119890] [2022-11-25 22:23:02,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:23:02,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 22:23:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:23:02,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 22:23:02,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-25 22:23:02,382 INFO L87 Difference]: Start difference. First operand 195 states and 217 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-25 22:23:04,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:06,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:08,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:10,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:12,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:14,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:16,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:20,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 22:23:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:23:20,955 INFO L93 Difference]: Finished difference Result 243 states and 263 transitions. [2022-11-25 22:23:20,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 22:23:20,956 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-25 22:23:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:23:20,957 INFO L225 Difference]: With dead ends: 243 [2022-11-25 22:23:20,957 INFO L226 Difference]: Without dead ends: 243 [2022-11-25 22:23:20,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-11-25 22:23:20,958 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 380 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:23:20,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 352 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 7 Unknown, 0 Unchecked, 17.1s Time] [2022-11-25 22:23:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-11-25 22:23:20,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2022-11-25 22:23:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.2298850574712643) internal successors, (214), 190 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 22:23:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions. [2022-11-25 22:23:20,963 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 37 [2022-11-25 22:23:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:23:20,963 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 214 transitions. [2022-11-25 22:23:20,963 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-25 22:23:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions. [2022-11-25 22:23:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 22:23:20,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:23:20,964 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-25 22:23:20,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Ended with exit code 0 [2022-11-25 22:23:21,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:23:21,178 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-25 22:23:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:23:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1825070928, now seen corresponding path program 1 times [2022-11-25 22:23:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:23:21,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819101214] [2022-11-25 22:23:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:23:21,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:23:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:23:21,180 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:23:21,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-11-25 22:23:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:23:21,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 22:23:21,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:23:21,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:23:21,513 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:23:21,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:23:21,866 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:23:21,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:23:22,431 INFO L350 Elim1Store]: Elim1 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-25 22:23:22,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-25 22:23:22,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 22:23:22,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-11-25 22:23:24,039 INFO L321 Elim1Store]: treesize reduction 27, result has 34.1 percent of original size [2022-11-25 22:23:24,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 35 [2022-11-25 22:23:24,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:23:24,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:23:24,478 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-25 22:23:24,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:23:24,479 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:23:24,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819101214] [2022-11-25 22:23:24,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819101214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:23:24,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:23:24,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 22:23:24,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893050308] [2022-11-25 22:23:24,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:23:24,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 22:23:24,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:23:24,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 22:23:24,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-11-25 22:23:24,481 INFO L87 Difference]: Start difference. First operand 191 states and 214 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-25 22:23:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:23:34,604 INFO L93 Difference]: Finished difference Result 217 states and 230 transitions. [2022-11-25 22:23:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 22:23:34,605 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-25 22:23:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:23:34,606 INFO L225 Difference]: With dead ends: 217 [2022-11-25 22:23:34,606 INFO L226 Difference]: Without dead ends: 217 [2022-11-25 22:23:34,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=435, Invalid=1205, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 22:23:34,607 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 352 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 30 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-25 22:23:34,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 443 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 592 Invalid, 3 Unknown, 0 Unchecked, 3.8s Time] [2022-11-25 22:23:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-25 22:23:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2022-11-25 22:23:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.2241379310344827) internal successors, (213), 190 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-25 22:23:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 213 transitions. [2022-11-25 22:23:34,610 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 213 transitions. Word has length 37 [2022-11-25 22:23:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:23:34,611 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 213 transitions. [2022-11-25 22:23:34,611 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-25 22:23:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 213 transitions. [2022-11-25 22:23:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 22:23:34,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:23:34,612 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:23:34,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Ended with exit code 0 [2022-11-25 22:23:34,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:23:34,823 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-25 22:23:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:23:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -220546803, now seen corresponding path program 3 times [2022-11-25 22:23:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:23:34,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943012591] [2022-11-25 22:23:34,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:23:34,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:23:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:23:34,825 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:23:34,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_73d989a4-2a82-4bc4-850a-113b5de1525a/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-11-25 22:23:35,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 22:23:35,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:23:35,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-25 22:23:35,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:23:35,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-25 22:23:35,752 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:23:35,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:23:35,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 22:23:35,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:23:35,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 22:23:36,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:23:36,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:23:36,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:23:36,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-25 22:23:36,703 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:23:36,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-25 22:23:37,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-25 22:23:37,145 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:23:37,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-25 22:23:37,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-11-25 22:23:37,642 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:23:37,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-25 22:23:38,112 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:23:38,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-25 22:23:38,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 22:23:38,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-25 22:23:38,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-25 22:23:38,523 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-25 22:23:38,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:23:39,143 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (and (forall ((v_ArrVal_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-25 22:23:39,205 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_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-25 22:23:40,087 WARN L837 $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-25 22:23:43,189 WARN L837 $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-25 22:23:43,450 WARN L837 $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-25 22:23:43,922 WARN L837 $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-25 22:23:44,826 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse1 (bvadd (_ bv4 32) .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (not (bvule (bvadd .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse1)) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (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-25 22:24:33,442 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (and (forall ((v_ArrVal_2008 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse17 v_ArrVal_2008))) (let ((.cse0 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse1 (bvadd .cse0 (_ bv8 32)))) (or (not (bvule (bvadd (_ bv4 32) .cse0) .cse1)) (forall ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_2007))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store .cse16 .cse14 v_ArrVal_2010))) (let ((.cse15 (select (select .cse12 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse2 (bvadd .cse15 (_ bv12 32)))) (or (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store .cse13 .cse14 v_ArrVal_2009))) (let ((.cse3 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store .cse12 .cse3 v_ArrVal_2011))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse5 (bvadd (_ bv16 32) .cse4))) (or (not (bvule (bvadd .cse4 (_ bv12 32)) .cse5)) (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store .cse11 .cse3 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 (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32))))) (not (bvule .cse5 (select |c_#length| .cse8)))))))))))))))) (not (bvule (bvadd .cse15 (_ bv8 32)) .cse2))))))) (not (bvule .cse1 (select |c_#length| .cse14)))))))))))) (forall ((v_ArrVal_2008 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| .cse17 v_ArrVal_2008))) (let ((.cse18 (select (select .cse34 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse19 (bvadd .cse18 (_ bv8 32)))) (or (not (bvule (bvadd (_ bv4 32) .cse18) .cse19)) (forall ((v_ArrVal_2007 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_2007))) (let ((.cse20 (select (select .cse32 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse19 (select |c_#length| .cse20))) (forall ((v_ArrVal_2010 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (store .cse34 .cse20 v_ArrVal_2010))) (let ((.cse33 (select (select .cse31 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse21 (bvadd .cse33 (_ bv12 32)))) (or (forall ((v_ArrVal_2009 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse30 (store .cse32 .cse20 v_ArrVal_2009))) (let ((.cse22 (select (select .cse30 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse21 (select |c_#length| .cse22))) (forall ((v_ArrVal_2011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse26 (store .cse31 .cse22 v_ArrVal_2011))) (let ((.cse23 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse24 (bvadd (_ bv16 32) .cse23))) (or (not (bvule (bvadd .cse23 (_ bv12 32)) .cse24)) (forall ((v_ArrVal_2012 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (store .cse30 .cse22 v_ArrVal_2012))) (let ((.cse25 (select (select .cse29 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (or (not (bvule .cse24 (select |c_#length| .cse25))) (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 ((.cse28 (store .cse29 .cse25 v_ArrVal_2013))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (bvule (bvadd (select (select (store (store .cse26 .cse25 v_ArrVal_2014) .cse27 v_ArrVal_2015) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) (_ bv24 32)) (select |c_#length| (select (select (store .cse28 .cse27 v_ArrVal_2016) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))))))))))))))))))) (not (bvule (bvadd .cse33 (_ bv8 32)) .cse21))))))))))))))))))) is different from false [2022-11-25 22:24:33,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:24:33,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1334 treesize of output 1234 [2022-11-25 22:24:33,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:24:33,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1198 treesize of output 718 [2022-11-25 22:24:33,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141852 treesize of output 124884 [2022-11-25 22:24:38,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131097462 treesize of output 129217284