./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW --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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- 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-4e7fbc6 [2022-11-23 14:26:38,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:26:38,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:26:38,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:26:38,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:26:38,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:26:38,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:26:38,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:26:38,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:26:38,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:26:38,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:26:38,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:26:38,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:26:38,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:26:38,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:26:38,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:26:38,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:26:38,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:26:38,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:26:38,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:26:38,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:26:38,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:26:38,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:26:38,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:26:38,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:26:38,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:26:38,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:26:38,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:26:38,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:26:38,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:26:38,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:26:38,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:26:38,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:26:38,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:26:38,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:26:38,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:26:38,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:26:38,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:26:38,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:26:38,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:26:38,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:26:38,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 14:26:38,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:26:38,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:26:38,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:26:38,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:26:38,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:26:38,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:26:38,818 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:26:38,819 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:26:38,819 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:26:38,819 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:26:38,820 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:26:38,820 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:26:38,820 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:26:38,821 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:26:38,821 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:26:38,821 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:26:38,821 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:26:38,821 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:26:38,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:26:38,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:26:38,822 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:26:38,823 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:26:38,823 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:26:38,823 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:26:38,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:26:38,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:26:38,824 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:26:38,824 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:26:38,824 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:26:38,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:26:38,825 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:26:38,825 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:26:38,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:26:38,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:26:38,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:26:38,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:26:38,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:26:38,826 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:26:38,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:26:38,827 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:26:38,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:26:38,827 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:26:38,827 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_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/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_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW 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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2022-11-23 14:26:39,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:26:39,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:26:39,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:26:39,178 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:26:39,178 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:26:39,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-23 14:26:42,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:26:42,570 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:26:42,571 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-23 14:26:42,593 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data/e0f964266/9bc0de0857d04d2f9300f2547b0c2651/FLAG70919b823 [2022-11-23 14:26:42,614 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data/e0f964266/9bc0de0857d04d2f9300f2547b0c2651 [2022-11-23 14:26:42,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:26:42,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:26:42,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:26:42,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:26:42,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:26:42,629 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:42" (1/1) ... [2022-11-23 14:26:42,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665a7212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:42, skipping insertion in model container [2022-11-23 14:26:42,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:42" (1/1) ... [2022-11-23 14:26:42,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:26:42,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:26:43,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:26:43,126 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-23 14:26:43,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@47a6fc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:43, skipping insertion in model container [2022-11-23 14:26:43,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:26:43,128 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-23 14:26:43,130 INFO L158 Benchmark]: Toolchain (without parser) took 509.34ms. Allocated memory is still 188.7MB. Free memory was 152.1MB in the beginning and 140.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 14:26:43,130 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:26:43,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.74ms. Allocated memory is still 188.7MB. Free memory was 152.1MB in the beginning and 140.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-23 14:26:43,133 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.17ms. Allocated memory is still 123.7MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 504.74ms. Allocated memory is still 188.7MB. Free memory was 152.1MB in the beginning and 140.1MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 571]: 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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW --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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- 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-4e7fbc6 [2022-11-23 14:26:45,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:26:45,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:26:45,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:26:45,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:26:45,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:26:45,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:26:45,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:26:45,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:26:45,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:26:45,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:26:45,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:26:45,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:26:45,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:26:45,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:26:45,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:26:45,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:26:45,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:26:45,476 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:26:45,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:26:45,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:26:45,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:26:45,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:26:45,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:26:45,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:26:45,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:26:45,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:26:45,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:26:45,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:26:45,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:26:45,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:26:45,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:26:45,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:26:45,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:26:45,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:26:45,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:26:45,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:26:45,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:26:45,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:26:45,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:26:45,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:26:45,496 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 14:26:45,518 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:26:45,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:26:45,519 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:26:45,519 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:26:45,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:26:45,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:26:45,521 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:26:45,521 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:26:45,521 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:26:45,522 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:26:45,522 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:26:45,522 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:26:45,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 14:26:45,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 14:26:45,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:26:45,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:26:45,525 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 14:26:45,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:26:45,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:26:45,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:26:45,526 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 14:26:45,526 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 14:26:45,527 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 14:26:45,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:26:45,527 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 14:26:45,527 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 14:26:45,528 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 14:26:45,528 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:26:45,528 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:26:45,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:26:45,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 14:26:45,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:26:45,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:26:45,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:26:45,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:26:45,530 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 14:26:45,531 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 14:26:45,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:26:45,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 14:26:45,531 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_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/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_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW 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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2022-11-23 14:26:45,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:26:45,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:26:45,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:26:45,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:26:45,912 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:26:45,913 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-23 14:26:49,135 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:26:49,396 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:26:49,396 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-23 14:26:49,425 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data/28ad21a4d/e93e9e6a2cdf4ecb98d9cb190395658f/FLAG1602955cf [2022-11-23 14:26:49,442 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/data/28ad21a4d/e93e9e6a2cdf4ecb98d9cb190395658f [2022-11-23 14:26:49,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:26:49,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:26:49,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:26:49,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:26:49,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:26:49,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:49" (1/1) ... [2022-11-23 14:26:49,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b1dd77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:49, skipping insertion in model container [2022-11-23 14:26:49,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:26:49" (1/1) ... [2022-11-23 14:26:49,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:26:49,511 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:26:49,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:26:49,857 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-23 14:26:49,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:26:49,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:26:49,900 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:26:49,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:26:50,035 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:26:50,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50 WrapperNode [2022-11-23 14:26:50,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:26:50,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:26:50,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:26:50,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:26:50,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,125 INFO L138 Inliner]: procedures = 125, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-11-23 14:26:50,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:26:50,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:26:50,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:26:50,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:26:50,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,158 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:26:50,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:26:50,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:26:50,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:26:50,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (1/1) ... [2022-11-23 14:26:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:26:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:26:50,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:26:50,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:26:50,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 14:26:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:26:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:26:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 14:26:50,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 14:26:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:26:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 14:26:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:26:50,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:26:50,433 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:26:50,435 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:26:51,261 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:26:51,273 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:26:51,274 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-23 14:26:51,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:51 BoogieIcfgContainer [2022-11-23 14:26:51,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:26:51,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:26:51,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:26:51,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:26:51,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:26:49" (1/3) ... [2022-11-23 14:26:51,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a26c186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:26:51, skipping insertion in model container [2022-11-23 14:26:51,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:26:50" (2/3) ... [2022-11-23 14:26:51,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a26c186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:26:51, skipping insertion in model container [2022-11-23 14:26:51,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:26:51" (3/3) ... [2022-11-23 14:26:51,290 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2022-11-23 14:26:51,310 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:26:51,310 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-11-23 14:26:51,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:26:51,380 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;@571a3541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:26:51,380 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-11-23 14:26:51,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 77 states have (on average 2.207792207792208) internal successors, (170), 154 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:26:51,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:51,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:26:51,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:51,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-23 14:26:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:51,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800786757] [2022-11-23 14:26:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:51,418 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-23 14:26:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:51,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:51,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:51,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 14:26:51,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:51,643 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-23 14:26:51,656 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-23 14:26:51,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:51,657 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:51,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800786757] [2022-11-23 14:26:51,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800786757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:51,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:51,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:26:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310570464] [2022-11-23 14:26:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:51,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:51,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:51,697 INFO L87 Difference]: Start difference. First operand has 155 states, 77 states have (on average 2.207792207792208) internal successors, (170), 154 states have internal predecessors, (170), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:51,999 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-11-23 14:26:52,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:52,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-23 14:26:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:52,010 INFO L225 Difference]: With dead ends: 169 [2022-11-23 14:26:52,011 INFO L226 Difference]: Without dead ends: 167 [2022-11-23 14:26:52,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 14:26:52,016 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:52,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 127 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:26:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-23 14:26:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2022-11-23 14:26:52,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 76 states have (on average 2.1315789473684212) internal successors, (162), 150 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-11-23 14:26:52,056 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-11-23 14:26:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:52,057 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-11-23 14:26:52,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-11-23 14:26:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-23 14:26:52,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:52,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-23 14:26:52,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 14:26:52,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:52,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:52,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:52,271 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-23 14:26:52,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:52,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286100955] [2022-11-23 14:26:52,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:52,271 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-23 14:26:52,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:52,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:52,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:52,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:26:52,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:52,383 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-23 14:26:52,393 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-23 14:26:52,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:52,394 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:52,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286100955] [2022-11-23 14:26:52,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286100955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:52,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:52,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:26:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598499285] [2022-11-23 14:26:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:52,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:52,397 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:52,738 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-11-23 14:26:52,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:52,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-23 14:26:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:52,741 INFO L225 Difference]: With dead ends: 149 [2022-11-23 14:26:52,742 INFO L226 Difference]: Without dead ends: 149 [2022-11-23 14:26:52,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 14:26:52,743 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:52,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 83 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:26:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-23 14:26:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-23 14:26:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 76 states have (on average 2.1052631578947367) internal successors, (160), 148 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-11-23 14:26:52,753 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 3 [2022-11-23 14:26:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:52,753 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-11-23 14:26:52,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-11-23 14:26:52,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:26:52,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:52,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:26:52,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:52,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:52,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:52,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:52,966 INFO L85 PathProgramCache]: Analyzing trace with hash 889446412, now seen corresponding path program 1 times [2022-11-23 14:26:52,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:52,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223365079] [2022-11-23 14:26:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:52,967 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-23 14:26:52,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:52,975 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:52,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:53,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:26:53,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:53,064 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-23 14:26:53,085 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-23 14:26:53,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:53,085 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:53,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223365079] [2022-11-23 14:26:53,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223365079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:53,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:53,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:53,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491449648] [2022-11-23 14:26:53,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:53,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:53,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:53,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:53,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:53,088 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:53,524 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2022-11-23 14:26:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:53,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-23 14:26:53,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:53,526 INFO L225 Difference]: With dead ends: 159 [2022-11-23 14:26:53,526 INFO L226 Difference]: Without dead ends: 159 [2022-11-23 14:26:53,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-23 14:26:53,528 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 206 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:53,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 91 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:26:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-23 14:26:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2022-11-23 14:26:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 133 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-11-23 14:26:53,536 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 6 [2022-11-23 14:26:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:53,537 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-11-23 14:26:53,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-11-23 14:26:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 14:26:53,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:53,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 14:26:53,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:53,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:53,749 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:53,750 INFO L85 PathProgramCache]: Analyzing trace with hash 889446413, now seen corresponding path program 1 times [2022-11-23 14:26:53,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:53,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962419721] [2022-11-23 14:26:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:53,751 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-23 14:26:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:53,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:53,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:53,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:26:53,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:53,853 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-23 14:26:53,931 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-23 14:26:53,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:53,931 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:53,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962419721] [2022-11-23 14:26:53,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962419721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:53,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:53,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243625458] [2022-11-23 14:26:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:53,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:53,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:53,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:53,933 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:54,596 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-11-23 14:26:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:26:54,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-23 14:26:54,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:54,599 INFO L225 Difference]: With dead ends: 185 [2022-11-23 14:26:54,599 INFO L226 Difference]: Without dead ends: 185 [2022-11-23 14:26:54,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-23 14:26:54,601 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 242 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:54,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 110 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:26:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-23 14:26:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2022-11-23 14:26:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.709090909090909) internal successors, (188), 164 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2022-11-23 14:26:54,609 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 6 [2022-11-23 14:26:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:54,609 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2022-11-23 14:26:54,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2022-11-23 14:26:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 14:26:54,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:54,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:54,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:54,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:54,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:54,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1845826674, now seen corresponding path program 1 times [2022-11-23 14:26:54,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:54,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249796891] [2022-11-23 14:26:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:54,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-23 14:26:54,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:54,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:54,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:54,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 14:26:54,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:54,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 6 treesize of output 7 [2022-11-23 14:26:54,939 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:26:54,940 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-23 14:26:54,949 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-23 14:26:54,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:54,949 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:54,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249796891] [2022-11-23 14:26:54,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [249796891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:54,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:54,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339899825] [2022-11-23 14:26:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:54,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:54,952 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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-23 14:26:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:55,346 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-11-23 14:26:55,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 14:26:55,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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-23 14:26:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:55,348 INFO L225 Difference]: With dead ends: 182 [2022-11-23 14:26:55,348 INFO L226 Difference]: Without dead ends: 182 [2022-11-23 14:26:55,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-23 14:26:55,349 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 113 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:55,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 175 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:26:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-23 14:26:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-11-23 14:26:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.7) internal successors, (187), 164 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2022-11-23 14:26:55,362 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 9 [2022-11-23 14:26:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:55,362 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2022-11-23 14:26:55,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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-23 14:26:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2022-11-23 14:26:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:26:55,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:55,363 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:55,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:55,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:55,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:55,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1772597097, now seen corresponding path program 1 times [2022-11-23 14:26:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:55,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304887762] [2022-11-23 14:26:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:55,565 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-23 14:26:55,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:55,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:55,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:55,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-23 14:26:55,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:55,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:55,676 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304887762] [2022-11-23 14:26:55,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304887762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:55,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:55,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:55,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510819308] [2022-11-23 14:26:55,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:55,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:55,679 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:26:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:55,690 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2022-11-23 14:26:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:55,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:26:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:55,692 INFO L225 Difference]: With dead ends: 167 [2022-11-23 14:26:55,692 INFO L226 Difference]: Without dead ends: 167 [2022-11-23 14:26:55,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-23 14:26:55,694 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:55,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 14:26:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-23 14:26:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-11-23 14:26:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.6875) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-11-23 14:26:55,702 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 13 [2022-11-23 14:26:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:55,702 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-11-23 14:26:55,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 14:26:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-11-23 14:26:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:26:55,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:55,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:55,727 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:55,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:55,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash 131239230, now seen corresponding path program 1 times [2022-11-23 14:26:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818528929] [2022-11-23 14:26:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:55,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 14:26:55,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:55,923 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:55,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:56,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:26:56,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:56,036 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-23 14:26:56,063 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-23 14:26:56,100 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-23 14:26:56,110 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-23 14:26:56,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:56,115 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:56,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818528929] [2022-11-23 14:26:56,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818528929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:56,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:56,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385975731] [2022-11-23 14:26:56,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:56,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:56,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:56,118 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-23 14:26:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:56,628 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2022-11-23 14:26:56,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-23 14:26:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:56,630 INFO L225 Difference]: With dead ends: 166 [2022-11-23 14:26:56,630 INFO L226 Difference]: Without dead ends: 166 [2022-11-23 14:26:56,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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-23 14:26:56,632 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 7 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:56,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 328 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:26:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-23 14:26:56,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-23 14:26:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 112 states have (on average 1.6696428571428572) internal successors, (187), 165 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2022-11-23 14:26:56,637 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 15 [2022-11-23 14:26:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:56,637 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2022-11-23 14:26:56,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-23 14:26:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2022-11-23 14:26:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:26:56,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:56,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:56,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:56,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:56,839 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:56,840 INFO L85 PathProgramCache]: Analyzing trace with hash 131239231, now seen corresponding path program 1 times [2022-11-23 14:26:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:56,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894611714] [2022-11-23 14:26:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:56,841 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-23 14:26:56,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:56,842 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:56,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:56,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 14:26:56,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:56,943 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-23 14:26:56,968 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-23 14:26:56,974 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-23 14:26:57,015 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-23 14:26:57,023 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-23 14:26:57,038 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-23 14:26:57,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:57,038 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:57,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894611714] [2022-11-23 14:26:57,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894611714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:57,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:57,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:57,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51414612] [2022-11-23 14:26:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:57,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:57,041 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-23 14:26:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:57,650 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-11-23 14:26:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-23 14:26:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:57,651 INFO L225 Difference]: With dead ends: 165 [2022-11-23 14:26:57,652 INFO L226 Difference]: Without dead ends: 165 [2022-11-23 14:26:57,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:26:57,652 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:57,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 310 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:26:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-23 14:26:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-23 14:26:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.6517857142857142) internal successors, (185), 164 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2022-11-23 14:26:57,657 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 15 [2022-11-23 14:26:57,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:57,657 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2022-11-23 14:26:57,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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-23 14:26:57,658 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2022-11-23 14:26:57,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:26:57,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:57,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:57,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:57,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:57,859 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1899349350, now seen corresponding path program 1 times [2022-11-23 14:26:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:57,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930805444] [2022-11-23 14:26:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:57,860 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-23 14:26:57,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:57,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:57,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:57,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 14:26:57,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:57,958 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-23 14:26:57,971 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-23 14:26:58,056 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-23 14:26:58,060 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-23 14:26:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:26:58,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:58,096 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:58,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930805444] [2022-11-23 14:26:58,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930805444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:58,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:58,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 14:26:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129542032] [2022-11-23 14:26:58,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:58,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:26:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:26:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:26:58,098 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand has 6 states, 6 states have (on average 2.5) 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-23 14:26:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:58,790 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2022-11-23 14:26:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 14:26:58,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) 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-23 14:26:58,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:58,792 INFO L225 Difference]: With dead ends: 203 [2022-11-23 14:26:58,792 INFO L226 Difference]: Without dead ends: 203 [2022-11-23 14:26:58,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:26:58,793 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 48 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:58,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 523 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:26:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-23 14:26:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2022-11-23 14:26:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 123 states have (on average 1.6260162601626016) internal successors, (200), 175 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2022-11-23 14:26:58,798 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 15 [2022-11-23 14:26:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:58,798 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2022-11-23 14:26:58,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) 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-23 14:26:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2022-11-23 14:26:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:26:58,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:58,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:58,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:58,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:58,999 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751881, now seen corresponding path program 1 times [2022-11-23 14:26:59,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:59,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913429046] [2022-11-23 14:26:59,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:59,001 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-23 14:26:59,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:59,006 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:59,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:59,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:26:59,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:26:59,124 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-23 14:26:59,139 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-23 14:26:59,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 23 treesize of output 11 [2022-11-23 14:26:59,174 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-23 14:26:59,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:26:59,174 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:26:59,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913429046] [2022-11-23 14:26:59,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913429046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:59,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:59,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811489044] [2022-11-23 14:26:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:59,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:26:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:59,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:59,177 INFO L87 Difference]: Start difference. First operand 176 states and 200 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-23 14:26:59,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:59,676 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2022-11-23 14:26:59,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:59,677 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-23 14:26:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:59,678 INFO L225 Difference]: With dead ends: 175 [2022-11-23 14:26:59,678 INFO L226 Difference]: Without dead ends: 175 [2022-11-23 14:26:59,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-23 14:26:59,679 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 7 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:59,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 323 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:26:59,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-23 14:26:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-23 14:26:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 123 states have (on average 1.6097560975609757) internal successors, (198), 174 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2022-11-23 14:26:59,684 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 17 [2022-11-23 14:26:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:59,684 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2022-11-23 14:26:59,684 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-23 14:26:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2022-11-23 14:26:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:26:59,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:59,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:59,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 14:26:59,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:59,897 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:26:59,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751880, now seen corresponding path program 1 times [2022-11-23 14:26:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:26:59,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078492364] [2022-11-23 14:26:59,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:59,898 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-23 14:26:59,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:26:59,899 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:26:59,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:00,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 14:27:00,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:00,019 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-23 14:27:00,040 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-23 14:27:00,050 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-23 14:27:00,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 21 treesize of output 9 [2022-11-23 14:27:00,100 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-23 14:27:00,117 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-23 14:27:00,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:00,117 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:00,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078492364] [2022-11-23 14:27:00,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078492364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:00,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:00,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:27:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006441952] [2022-11-23 14:27:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:00,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:27:00,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:27:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:27:00,119 INFO L87 Difference]: Start difference. First operand 175 states and 198 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-23 14:27:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:00,710 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2022-11-23 14:27:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:27:00,711 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-23 14:27:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:00,712 INFO L225 Difference]: With dead ends: 174 [2022-11-23 14:27:00,712 INFO L226 Difference]: Without dead ends: 174 [2022-11-23 14:27:00,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:27:00,713 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:00,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 305 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 14:27:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-23 14:27:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-11-23 14:27:00,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 123 states have (on average 1.5934959349593496) internal successors, (196), 173 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2022-11-23 14:27:00,717 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 17 [2022-11-23 14:27:00,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:00,717 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2022-11-23 14:27:00,717 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-23 14:27:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2022-11-23 14:27:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:27:00,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:00,718 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:00,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:00,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:00,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:00,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1696190880, now seen corresponding path program 1 times [2022-11-23 14:27:00,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:00,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826944825] [2022-11-23 14:27:00,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:00,920 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-23 14:27:00,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:00,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:00,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:01,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 14:27:01,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:01,059 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-23 14:27:01,065 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-23 14:27:01,086 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 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 14:27:01,100 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-23 14:27:01,141 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-23 14:27:01,151 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-23 14:27:01,221 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-23 14:27:01,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:01,221 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:01,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826944825] [2022-11-23 14:27:01,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826944825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:01,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:01,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:27:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938178672] [2022-11-23 14:27:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:01,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:27:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:27:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:27:01,224 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-23 14:27:01,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:01,899 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2022-11-23 14:27:01,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 14:27:01,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-23 14:27:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:01,901 INFO L225 Difference]: With dead ends: 287 [2022-11-23 14:27:01,901 INFO L226 Difference]: Without dead ends: 287 [2022-11-23 14:27:01,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-23 14:27:01,902 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 161 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:01,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 588 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 14:27:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-23 14:27:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 184. [2022-11-23 14:27:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 183 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-11-23 14:27:01,906 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 17 [2022-11-23 14:27:01,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:01,907 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-11-23 14:27:01,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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-23 14:27:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-11-23 14:27:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:27:01,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:01,908 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:01,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:02,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:02,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188958, now seen corresponding path program 1 times [2022-11-23 14:27:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:02,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182315771] [2022-11-23 14:27:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:02,109 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-23 14:27:02,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:02,110 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:02,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:02,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 14:27:02,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:02,241 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-23 14:27:02,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:02,242 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:02,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182315771] [2022-11-23 14:27:02,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182315771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:02,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:02,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:27:02,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835194904] [2022-11-23 14:27:02,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:02,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:27:02,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:27:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:27:02,245 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:02,706 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-11-23 14:27:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:27:02,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 14:27:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:02,707 INFO L225 Difference]: With dead ends: 225 [2022-11-23 14:27:02,708 INFO L226 Difference]: Without dead ends: 225 [2022-11-23 14:27:02,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-23 14:27:02,708 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 132 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:02,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 166 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:27:02,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-23 14:27:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2022-11-23 14:27:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 185 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-23 14:27:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2022-11-23 14:27:02,713 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 17 [2022-11-23 14:27:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:02,713 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2022-11-23 14:27:02,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2022-11-23 14:27:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:27:02,714 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:02,714 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:02,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:02,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:02,915 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:02,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188959, now seen corresponding path program 1 times [2022-11-23 14:27:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:02,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253730202] [2022-11-23 14:27:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:02,916 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-23 14:27:02,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:02,917 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:02,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-23 14:27:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:03,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 14:27:03,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:03,111 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-23 14:27:03,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:03,111 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:03,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253730202] [2022-11-23 14:27:03,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253730202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:03,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:03,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:27:03,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732833781] [2022-11-23 14:27:03,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:03,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:27:03,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:03,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:27:03,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:27:03,113 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-23 14:27:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:04,009 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2022-11-23 14:27:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:27:04,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-23 14:27:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:04,011 INFO L225 Difference]: With dead ends: 302 [2022-11-23 14:27:04,012 INFO L226 Difference]: Without dead ends: 302 [2022-11-23 14:27:04,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-23 14:27:04,012 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 409 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:04,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 306 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:27:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-23 14:27:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 189. [2022-11-23 14:27:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.5579710144927537) internal successors, (215), 188 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-23 14:27:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2022-11-23 14:27:04,018 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 17 [2022-11-23 14:27:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:04,018 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2022-11-23 14:27:04,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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-23 14:27:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2022-11-23 14:27:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:27:04,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:04,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:04,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:04,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:04,220 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705298, now seen corresponding path program 1 times [2022-11-23 14:27:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:04,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137149054] [2022-11-23 14:27:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:04,221 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-23 14:27:04,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:04,223 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:04,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Waiting until timeout for monitored process [2022-11-23 14:27:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:04,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 14:27:04,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:04,364 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-23 14:27:04,407 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:27:04,408 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-23 14:27:04,419 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-23 14:27:04,479 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-23 14:27:04,489 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-23 14:27:04,589 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:04,589 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 38 treesize of output 37 [2022-11-23 14:27:04,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:27:04,626 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 25 treesize of output 13 [2022-11-23 14:27:04,635 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 15 treesize of output 7 [2022-11-23 14:27:04,656 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-23 14:27:04,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:04,656 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:04,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137149054] [2022-11-23 14:27:04,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137149054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:04,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:04,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:27:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165598132] [2022-11-23 14:27:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:04,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:27:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:27:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:27:04,658 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:05,644 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2022-11-23 14:27:05,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:27:05,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-23 14:27:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:05,646 INFO L225 Difference]: With dead ends: 207 [2022-11-23 14:27:05,646 INFO L226 Difference]: Without dead ends: 207 [2022-11-23 14:27:05,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-23 14:27:05,647 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 184 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:05,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 195 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:27:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-23 14:27:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2022-11-23 14:27:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 187 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-23 14:27:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2022-11-23 14:27:05,652 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 18 [2022-11-23 14:27:05,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:05,652 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2022-11-23 14:27:05,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2022-11-23 14:27:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:27:05,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:05,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:05,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:05,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:05,865 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:05,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705297, now seen corresponding path program 1 times [2022-11-23 14:27:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:05,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888217036] [2022-11-23 14:27:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:05,866 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-23 14:27:05,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:05,867 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:05,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:05,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 14:27:05,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:06,017 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:27:06,017 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 12 treesize of output 22 [2022-11-23 14:27:06,170 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-23 14:27:06,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-11-23 14:27:06,243 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-23 14:27:06,412 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:06,412 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-23 14:27:06,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-23 14:27:06,557 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-23 14:27:06,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:06,558 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:06,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888217036] [2022-11-23 14:27:06,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888217036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:06,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:06,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:27:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262622846] [2022-11-23 14:27:06,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:06,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:27:06,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:27:06,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:27:06,562 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:07,790 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2022-11-23 14:27:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 14:27:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-23 14:27:07,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:07,792 INFO L225 Difference]: With dead ends: 206 [2022-11-23 14:27:07,792 INFO L226 Difference]: Without dead ends: 206 [2022-11-23 14:27:07,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-11-23 14:27:07,793 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 321 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:07,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 220 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:27:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-23 14:27:07,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2022-11-23 14:27:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 138 states have (on average 1.5217391304347827) internal successors, (210), 186 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-23 14:27:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2022-11-23 14:27:07,798 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 18 [2022-11-23 14:27:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:07,799 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2022-11-23 14:27:07,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2022-11-23 14:27:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:27:07,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:07,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:07,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:08,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:08,012 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1042249152, now seen corresponding path program 1 times [2022-11-23 14:27:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:08,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493029527] [2022-11-23 14:27:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:08,013 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-23 14:27:08,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:08,014 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:08,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-23 14:27:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:08,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 14:27:08,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:08,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:08,249 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:08,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493029527] [2022-11-23 14:27:08,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493029527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:08,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1621031108] [2022-11-23 14:27:08,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:08,250 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:27:08,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:27:08,254 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:27:08,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-23 14:27:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:08,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 14:27:08,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:27:08,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:08,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1621031108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:08,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:27:08,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 10 [2022-11-23 14:27:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076110329] [2022-11-23 14:27:08,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:08,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:27:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:08,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:27:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:27:08,611 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:09,373 INFO L93 Difference]: Finished difference Result 274 states and 301 transitions. [2022-11-23 14:27:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:27:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-23 14:27:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:09,375 INFO L225 Difference]: With dead ends: 274 [2022-11-23 14:27:09,375 INFO L226 Difference]: Without dead ends: 274 [2022-11-23 14:27:09,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-23 14:27:09,376 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 319 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:09,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 295 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 14:27:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-23 14:27:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 186. [2022-11-23 14:27:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 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-23 14:27:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-11-23 14:27:09,380 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 18 [2022-11-23 14:27:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:09,381 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-11-23 14:27:09,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-11-23 14:27:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:27:09,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:09,381 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-23 14:27:09,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2022-11-23 14:27:09,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:09,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:09,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:09,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350413, now seen corresponding path program 1 times [2022-11-23 14:27:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:09,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537853844] [2022-11-23 14:27:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:09,785 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-23 14:27:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:09,786 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:09,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:09,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 14:27:09,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:09,952 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 14:27:09,952 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 12 treesize of output 22 [2022-11-23 14:27:10,109 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-23 14:27:10,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-11-23 14:27:10,166 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-23 14:27:10,351 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:10,352 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 54 treesize of output 53 [2022-11-23 14:27:10,405 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 51 treesize of output 27 [2022-11-23 14:27:10,485 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-23 14:27:10,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:10,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:10,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537853844] [2022-11-23 14:27:10,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537853844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:10,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:10,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:27:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805225132] [2022-11-23 14:27:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:10,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:27:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:27:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:27:10,487 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-23 14:27:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:11,743 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2022-11-23 14:27:11,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 14:27:11,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-23 14:27:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:11,744 INFO L225 Difference]: With dead ends: 205 [2022-11-23 14:27:11,745 INFO L226 Difference]: Without dead ends: 205 [2022-11-23 14:27:11,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-11-23 14:27:11,746 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 318 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:11,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 216 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 14:27:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-23 14:27:11,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2022-11-23 14:27:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 137 states have (on average 1.510948905109489) internal successors, (207), 184 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-11-23 14:27:11,750 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 20 [2022-11-23 14:27:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:11,751 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-11-23 14:27:11,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-23 14:27:11,751 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-11-23 14:27:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:27:11,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:11,752 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-23 14:27:11,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:11,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:11,963 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350412, now seen corresponding path program 1 times [2022-11-23 14:27:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:11,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398367239] [2022-11-23 14:27:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:11,964 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-23 14:27:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:11,965 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:11,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:12,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-23 14:27:12,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:12,092 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-23 14:27:12,138 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-23 14:27:12,150 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:27:12,151 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-23 14:27:12,183 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-23 14:27:12,195 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-23 14:27:12,307 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:12,308 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-23 14:27:12,316 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-23 14:27:12,349 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-23 14:27:12,352 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-23 14:27:12,375 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-23 14:27:12,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:27:12,375 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:12,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398367239] [2022-11-23 14:27:12,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398367239] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:27:12,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:27:12,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:27:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267970572] [2022-11-23 14:27:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:27:12,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 14:27:12,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:12,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 14:27:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:27:12,377 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-23 14:27:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:13,574 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2022-11-23 14:27:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 14:27:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-23 14:27:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:13,575 INFO L225 Difference]: With dead ends: 204 [2022-11-23 14:27:13,575 INFO L226 Difference]: Without dead ends: 204 [2022-11-23 14:27:13,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-23 14:27:13,576 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 173 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:13,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 224 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 14:27:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-23 14:27:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2022-11-23 14:27:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 137 states have (on average 1.5036496350364963) internal successors, (206), 183 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:13,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-11-23 14:27:13,583 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 20 [2022-11-23 14:27:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:13,583 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-11-23 14:27:13,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-23 14:27:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-11-23 14:27:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-23 14:27:13,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:13,587 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:27:13,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 14:27:13,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:13,798 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:13,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1776483090, now seen corresponding path program 1 times [2022-11-23 14:27:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36474908] [2022-11-23 14:27:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:13,799 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-23 14:27:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:13,800 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:13,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:13,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-23 14:27:13,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:13,949 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-23 14:27:13,955 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-23 14:27:14,062 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 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-23 14:27:14,073 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 27 treesize of output 20 [2022-11-23 14:27:14,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:14,135 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 1 case distinctions, treesize of input 36 treesize of output 23 [2022-11-23 14:27:14,142 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 36 treesize of output 23 [2022-11-23 14:27:14,209 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-23 14:27:14,213 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-23 14:27:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:14,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:14,440 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:14,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36474908] [2022-11-23 14:27:14,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36474908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:14,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206973203] [2022-11-23 14:27:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:14,441 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:27:14,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:27:14,442 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:27:14,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-23 14:27:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:14,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-23 14:27:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:14,772 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-23 14:27:14,778 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-23 14:27:14,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:27:14,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:27:14,983 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-23 14:27:14,984 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 25 treesize of output 27 [2022-11-23 14:27:15,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:27:15,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:27:15,002 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-23 14:27:15,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:27:15,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:15,096 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 36 treesize of output 23 [2022-11-23 14:27:15,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:27:15,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2022-11-23 14:27:15,248 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-23 14:27:15,250 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-23 14:27:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:15,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:15,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [206973203] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:15,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683067734] [2022-11-23 14:27:15,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:15,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:15,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:27:15,406 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:27:15,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-23 14:27:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:15,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:27:15,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:15,545 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-23 14:27:15,553 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-23 14:27:15,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:27:15,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:27:15,625 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2022-11-23 14:27:15,625 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 25 treesize of output 27 [2022-11-23 14:27:15,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:27:15,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:27:15,638 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-23 14:27:15,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:27:15,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:27:15,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:15,722 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 33 [2022-11-23 14:27:15,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:27:15,732 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 36 treesize of output 23 [2022-11-23 14:27:15,836 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-23 14:27:15,838 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-23 14:27:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:15,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:15,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683067734] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:15,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:27:15,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12, 10, 12, 10] total 19 [2022-11-23 14:27:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559002062] [2022-11-23 14:27:15,992 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:27:15,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 14:27:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:27:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 14:27:15,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-11-23 14:27:15,994 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:27:17,947 INFO L93 Difference]: Finished difference Result 295 states and 332 transitions. [2022-11-23 14:27:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 14:27:17,948 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 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-23 14:27:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:27:17,950 INFO L225 Difference]: With dead ends: 295 [2022-11-23 14:27:17,950 INFO L226 Difference]: Without dead ends: 295 [2022-11-23 14:27:17,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2022-11-23 14:27:17,951 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 385 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:27:17,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1198 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 14:27:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-23 14:27:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 242. [2022-11-23 14:27:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 195 states have (on average 1.4512820512820512) internal successors, (283), 241 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 283 transitions. [2022-11-23 14:27:17,957 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 283 transitions. Word has length 26 [2022-11-23 14:27:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:27:17,958 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 283 transitions. [2022-11-23 14:27:17,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:27:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 283 transitions. [2022-11-23 14:27:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:27:17,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:27:17,959 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-23 14:27:17,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-23 14:27:18,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 14:27:18,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-23 14:27:18,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:18,562 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:27:18,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:27:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719994, now seen corresponding path program 1 times [2022-11-23 14:27:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:27:18,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815872926] [2022-11-23 14:27:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:18,563 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-23 14:27:18,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:27:18,564 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:27:18,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-23 14:27:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:18,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 14:27:18,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:18,763 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-23 14:27:18,890 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:27:18,890 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-23 14:27:18,940 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-23 14:27:19,083 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:19,083 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-23 14:27:19,187 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:19,187 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-23 14:27:19,340 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-23 14:27:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:19,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:19,560 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_671) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 14:27:21,665 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_670))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_671)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 14:27:21,688 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_670))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_671))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 14:27:21,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:21,716 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 48 treesize of output 39 [2022-11-23 14:27:21,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:21,768 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 267 [2022-11-23 14:27:21,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:21,795 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 252 treesize of output 228 [2022-11-23 14:27:21,804 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 220 treesize of output 204 [2022-11-23 14:27:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:36,103 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:27:36,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815872926] [2022-11-23 14:27:36,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815872926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:36,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1745144633] [2022-11-23 14:27:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:36,103 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:27:36,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:27:36,107 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:27:36,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-23 14:27:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:36,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-23 14:27:36,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:36,513 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:27:36,514 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-23 14:27:36,875 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-23 14:27:36,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-23 14:27:36,986 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 13 treesize of output 9 [2022-11-23 14:27:37,301 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:37,301 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-23 14:27:37,503 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:37,504 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-23 14:27:37,887 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 35 treesize of output 19 [2022-11-23 14:27:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:38,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:42,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_710))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_671)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (_ bv0 1))) is different from false [2022-11-23 14:27:42,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_710))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_671))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 14:27:42,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:42,375 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 48 treesize of output 39 [2022-11-23 14:27:42,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:42,401 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 267 [2022-11-23 14:27:42,412 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 252 treesize of output 236 [2022-11-23 14:27:42,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:42,455 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 236 treesize of output 212 [2022-11-23 14:27:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:50,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1745144633] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:27:50,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822446156] [2022-11-23 14:27:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:27:50,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:27:50,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:27:50,199 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:27:50,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-23 14:27:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:27:50,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 14:27:50,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:27:50,709 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:27:50,709 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-23 14:27:50,829 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-23 14:27:51,154 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:51,155 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-23 14:27:51,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:27:51,332 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-23 14:27:51,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-23 14:27:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:27:51,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:27:51,780 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_750) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 14:27:51,954 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_749))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_671)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2022-11-23 14:27:51,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_749 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_749))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_671))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-23 14:27:52,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:52,001 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 48 treesize of output 39 [2022-11-23 14:27:52,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:52,025 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 153 [2022-11-23 14:27:52,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:52,052 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 138 treesize of output 126 [2022-11-23 14:27:52,060 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 118 treesize of output 110 [2022-11-23 14:27:57,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:27:57,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 82 treesize of output 278 [2022-11-23 14:28:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:28:04,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822446156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:28:04,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:28:04,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 12, 12, 12] total 49 [2022-11-23 14:28:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202007268] [2022-11-23 14:28:04,968 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:28:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-23 14:28:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:28:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-23 14:28:04,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1400, Unknown=13, NotChecked=696, Total=2450 [2022-11-23 14:28:04,971 INFO L87 Difference]: Start difference. First operand 242 states and 283 transitions. Second operand has 50 states, 49 states have (on average 2.877551020408163) internal successors, (141), 50 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:28:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:28:11,453 INFO L93 Difference]: Finished difference Result 439 states and 519 transitions. [2022-11-23 14:28:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 14:28:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.877551020408163) internal successors, (141), 50 states have internal predecessors, (141), 0 states have call successors, (0), 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-23 14:28:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:28:11,456 INFO L225 Difference]: With dead ends: 439 [2022-11-23 14:28:11,456 INFO L226 Difference]: Without dead ends: 439 [2022-11-23 14:28:11,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 132 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=617, Invalid=2264, Unknown=13, NotChecked=888, Total=3782 [2022-11-23 14:28:11,458 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1335 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2406 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:28:11,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 1184 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2190 Invalid, 0 Unknown, 2406 Unchecked, 5.2s Time] [2022-11-23 14:28:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-11-23 14:28:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 277. [2022-11-23 14:28:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 230 states have (on average 1.4652173913043478) internal successors, (337), 276 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:28:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 337 transitions. [2022-11-23 14:28:11,465 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 337 transitions. Word has length 32 [2022-11-23 14:28:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:28:11,466 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 337 transitions. [2022-11-23 14:28:11,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.877551020408163) internal successors, (141), 50 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:28:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 337 transitions. [2022-11-23 14:28:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:28:11,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:28:11,467 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-23 14:28:11,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-11-23 14:28:11,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-11-23 14:28:11,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-23 14:28:12,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:28:12,080 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:28:12,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:28:12,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719993, now seen corresponding path program 1 times [2022-11-23 14:28:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:28:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950827126] [2022-11-23 14:28:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:28:12,081 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-23 14:28:12,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:28:12,082 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:28:12,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:28:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:28:12,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-23 14:28:12,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:28:12,251 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-23 14:28:12,412 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-23 14:28:12,435 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:28:12,435 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-23 14:28:12,485 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-23 14:28:12,504 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-23 14:28:12,684 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:28:12,685 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-23 14:28:12,692 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-23 14:28:12,837 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:28:12,837 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-23 14:28:12,849 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-23 14:28:13,104 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-23 14:28:13,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 25 treesize of output 13 [2022-11-23 14:28:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:28:13,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:28:13,735 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2022-11-23 14:28:13,772 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_793) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) is different from false [2022-11-23 14:28:13,848 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_791))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_792) .cse0 v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_793) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_792) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_791) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))) is different from false [2022-11-23 14:28:14,017 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (and (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_792) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_791) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_791))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_792) .cse4 v_ArrVal_794) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_793) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))))))))) is different from false [2022-11-23 14:28:14,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:28:14,080 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-23 14:28:14,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:28:14,098 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-23 14:28:14,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:28:14,160 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 400 treesize of output 345 [2022-11-23 14:28:14,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:28:14,218 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1148 treesize of output 1081 [2022-11-23 14:28:14,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1066 treesize of output 986 [2022-11-23 14:28:14,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 986 treesize of output 954 [2022-11-23 14:28:14,277 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 954 treesize of output 874 [2022-11-23 14:28:14,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:28:14,328 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 874 treesize of output 730 [2022-11-23 14:31:38,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:31:38,453 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 87 treesize of output 78 [2022-11-23 14:31:38,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:31:38,471 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 67 treesize of output 58 [2022-11-23 14:31:38,486 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 98 treesize of output 80 [2022-11-23 14:31:38,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:31:38,530 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 143 [2022-11-23 14:31:38,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 78 [2022-11-23 14:31:38,562 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 112 treesize of output 88 [2022-11-23 14:31:38,578 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 62 treesize of output 54 [2022-11-23 14:31:45,933 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 130 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:31:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:31:46,290 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:31:46,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950827126] [2022-11-23 14:31:46,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950827126] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:31:46,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1472195055] [2022-11-23 14:31:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:31:46,291 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:31:46,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:31:46,293 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:31:46,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-23 14:31:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:31:46,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 14:31:46,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:31:46,702 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-23 14:31:46,733 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-23 14:31:47,386 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:31:47,387 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-23 14:31:47,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:31:47,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 21 treesize of output 20 [2022-11-23 14:31:47,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:31:47,550 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 21 treesize of output 20 [2022-11-23 14:31:47,920 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:31:47,920 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 42 treesize of output 41 [2022-11-23 14:31:47,928 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 20 treesize of output 22 [2022-11-23 14:31:48,154 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:31:48,155 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 42 treesize of output 41 [2022-11-23 14:31:48,165 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 20 treesize of output 22 [2022-11-23 14:31:48,444 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-23 14:31:48,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:31:48,452 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 1 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:31:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:31:48,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:31:49,225 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))))) (and (forall ((v_ArrVal_838 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_838) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_839) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:31:49,268 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_837) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_836) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_839) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_838 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_836))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_838)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:31:49,299 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_838 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_838)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_837) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_836) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_839) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-23 14:31:49,388 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc18#1.base|)))) (and (forall ((v_ArrVal_836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_838 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_836))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_838)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_833 (_ BitVec 32)) (v_ArrVal_836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_833)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_837) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_836) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_839) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-23 14:31:51,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:31:51,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 119 [2022-11-23 14:31:51,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:31:51,658 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 479 treesize of output 329 [2022-11-23 14:31:51,673 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 318 treesize of output 294 [2022-11-23 14:31:51,688 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 278 treesize of output 274 [2022-11-23 14:31:51,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:31:51,734 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 274 treesize of output 257 [2022-11-23 14:31:51,747 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 246 treesize of output 238 [2022-11-23 14:32:03,607 WARN L233 SmtUtils]: Spent 10.13s on a formula simplification. DAG size of input: 73 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:32:03,794 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 8 treesize of output 4 [2022-11-23 14:32:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:03,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1472195055] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:32:03,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703565632] [2022-11-23 14:32:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:03,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:32:03,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:32:03,803 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:32:03,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-23 14:32:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:03,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-23 14:32:03,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:32:04,353 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-23 14:32:04,380 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:32:04,380 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-23 14:32:04,408 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-23 14:32:04,433 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-23 14:32:04,543 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:04,543 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-23 14:32:04,554 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-23 14:32:04,662 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:04,663 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-23 14:32:04,669 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-23 14:32:04,852 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-23 14:32:04,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 14:32:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:04,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:32:05,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_881) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) is different from false [2022-11-23 14:32:05,175 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_881) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))) is different from false [2022-11-23 14:32:05,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_879))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_880) .cse0 v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_881) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1)))))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_880) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))) is different from false [2022-11-23 14:32:05,342 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_879))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_880) .cse1 v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv4 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_881) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_880) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_879) |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) v_ArrVal_882) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse5 (bvadd .cse5 (_ bv4 32)))))))) is different from false [2022-11-23 14:32:05,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:05,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2022-11-23 14:32:05,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:05,411 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 67 treesize of output 58 [2022-11-23 14:32:05,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2022-11-23 14:32:05,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:05,455 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 235 [2022-11-23 14:32:05,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 170 [2022-11-23 14:32:05,487 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 204 treesize of output 164 [2022-11-23 14:32:05,502 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 138 treesize of output 114 [2022-11-23 14:32:05,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:05,768 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 89 treesize of output 90 [2022-11-23 14:32:05,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:05,792 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 79 treesize of output 60 [2022-11-23 14:32:05,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:32:05,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:32:05,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:32:05,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2022-11-23 14:32:05,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:32:05,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:32:05,826 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2022-11-23 14:32:05,846 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-23 14:32:06,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:06,130 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 30 treesize of output 54 [2022-11-23 14:32:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:06,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703565632] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:32:06,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:32:06,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 15, 17, 12, 12] total 53 [2022-11-23 14:32:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276274859] [2022-11-23 14:32:06,289 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:32:06,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-23 14:32:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:32:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-23 14:32:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1430, Unknown=47, NotChecked=1068, Total=2756 [2022-11-23 14:32:06,291 INFO L87 Difference]: Start difference. First operand 277 states and 337 transitions. Second operand has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 53 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:39,566 INFO L93 Difference]: Finished difference Result 457 states and 530 transitions. [2022-11-23 14:32:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-23 14:32:39,567 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 53 states have internal predecessors, (127), 0 states have call successors, (0), 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-23 14:32:39,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:39,568 INFO L225 Difference]: With dead ends: 457 [2022-11-23 14:32:39,569 INFO L226 Difference]: Without dead ends: 457 [2022-11-23 14:32:39,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 12 IntricatePredicates, 4 DeprecatedPredicates, 1606 ImplicationChecksByTransitivity, 42.9s TimeCoverageRelationStatistics Valid=1130, Invalid=5650, Unknown=74, NotChecked=2076, Total=8930 [2022-11-23 14:32:39,572 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 804 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 170 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 6442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 3061 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:39,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1643 Invalid, 6442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 3205 Invalid, 6 Unknown, 3061 Unchecked, 13.2s Time] [2022-11-23 14:32:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-11-23 14:32:39,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 318. [2022-11-23 14:32:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 276 states have (on average 1.391304347826087) internal successors, (384), 317 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 384 transitions. [2022-11-23 14:32:39,591 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 384 transitions. Word has length 32 [2022-11-23 14:32:39,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:39,591 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 384 transitions. [2022-11-23 14:32:39,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 53 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:39,592 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 384 transitions. [2022-11-23 14:32:39,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:32:39,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:39,593 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-23 14:32:39,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-23 14:32:39,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-23 14:32:40,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 14:32:40,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:32:40,197 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:32:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:32:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash 892950918, now seen corresponding path program 1 times [2022-11-23 14:32:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:32:40,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120920878] [2022-11-23 14:32:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:40,198 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-23 14:32:40,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:32:40,200 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:32:40,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:32:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:40,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 14:32:40,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:32:40,414 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-23 14:32:40,447 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-23 14:32:40,465 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-23 14:32:40,777 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:32:40,778 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-23 14:32:40,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 14:32:40,866 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 21 treesize of output 20 [2022-11-23 14:32:41,091 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:41,091 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 38 treesize of output 37 [2022-11-23 14:32:41,107 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 20 treesize of output 22 [2022-11-23 14:32:41,288 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:41,288 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 38 treesize of output 37 [2022-11-23 14:32:41,305 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 20 treesize of output 22 [2022-11-23 14:32:41,561 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-23 14:32:41,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:41,566 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 1 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:32:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:41,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:32:41,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_928) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))) (forall ((v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))))) is different from false [2022-11-23 14:32:42,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_926) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_928) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))) (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_927))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_929)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))))) is different from false [2022-11-23 14:32:42,118 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_927))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_929)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv0 32))) (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_926) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_927) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_928) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv0 32))))) is different from false [2022-11-23 14:32:42,192 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_#t~malloc13#1.base|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_927))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_929)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv0 32))) (forall ((v_ArrVal_923 (_ BitVec 32)) (v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| v_ArrVal_923)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_926) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_927) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_928) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv0 32))))) is different from false [2022-11-23 14:32:42,812 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc13#1.base_11| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc13#1.base_11|))) (forall ((v_ArrVal_923 (_ BitVec 32)) (v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset| v_ArrVal_923)) |v_ULTIMATE.start_main_#t~malloc13#1.base_11| v_ArrVal_926) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_#t~malloc13#1.base_11|)) |v_ULTIMATE.start_main_#t~malloc13#1.base_11| v_ArrVal_927) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) v_ArrVal_928) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc13#1.base_11| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc13#1.base_11|))) (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~root~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~root~0#1.offset| |v_ULTIMATE.start_main_#t~malloc13#1.base_11|)) |v_ULTIMATE.start_main_#t~malloc13#1.base_11| v_ArrVal_927))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) v_ArrVal_929)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))))) is different from false [2022-11-23 14:32:42,869 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:42,869 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 2 case distinctions, treesize of input 48 treesize of output 41 [2022-11-23 14:32:42,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:42,879 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 88 [2022-11-23 14:32:42,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:42,895 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 28 treesize of output 20 [2022-11-23 14:32:42,901 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-23 14:32:42,915 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-23 14:32:42,915 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 2 case distinctions, treesize of input 48 treesize of output 1 [2022-11-23 14:32:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 14:32:42,998 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:32:42,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120920878] [2022-11-23 14:32:42,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120920878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:32:42,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1670074222] [2022-11-23 14:32:42,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:42,998 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:32:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:32:43,000 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:32:43,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-23 14:32:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:43,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:32:43,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:32:43,321 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-23 14:32:43,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 14:32:43,347 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-23 14:32:43,558 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:32:43,559 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-23 14:32:43,606 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 21 treesize of output 20 [2022-11-23 14:32:43,627 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 21 treesize of output 20 [2022-11-23 14:32:43,747 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:43,747 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 38 treesize of output 37 [2022-11-23 14:32:43,765 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 20 treesize of output 22 [2022-11-23 14:32:43,983 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:43,983 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 38 treesize of output 37 [2022-11-23 14:32:43,994 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 20 treesize of output 22 [2022-11-23 14:32:44,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:32:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-11-23 14:32:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:44,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:32:44,720 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_975) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))) (forall ((v_ArrVal_976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_976) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))) is different from false [2022-11-23 14:32:44,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))) (forall ((v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_973) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_976) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))) is different from false [2022-11-23 14:32:44,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_973) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_974) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_976) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_974))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))) is different from false [2022-11-23 14:32:44,868 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_#t~malloc13#1.base|))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv0 32))) (forall ((v_ArrVal_973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_970 (_ BitVec 32)) (v_ArrVal_974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_976 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| v_ArrVal_970)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_973) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_974) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_976) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv0 32))))) is different from false [2022-11-23 14:32:46,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:46,292 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 2 case distinctions, treesize of input 48 treesize of output 54 [2022-11-23 14:32:46,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:46,315 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 2 case distinctions, treesize of input 35 treesize of output 41 [2022-11-23 14:32:46,323 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 75 treesize of output 49 [2022-11-23 14:32:46,335 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 188 treesize of output 164 [2022-11-23 14:32:46,350 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 58 [2022-11-23 14:32:46,355 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 58 treesize of output 50 [2022-11-23 14:32:46,361 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 50 treesize of output 42 [2022-11-23 14:32:46,384 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-23 14:32:46,384 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 2 case distinctions, treesize of input 48 treesize of output 1 [2022-11-23 14:32:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:46,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1670074222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:32:46,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075720991] [2022-11-23 14:32:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:32:46,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:32:46,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:32:46,395 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:32:46,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-23 14:32:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:32:46,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-23 14:32:46,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:32:46,699 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-23 14:32:46,710 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-23 14:32:47,247 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:32:47,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-23 14:32:47,290 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 21 treesize of output 20 [2022-11-23 14:32:47,323 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 21 treesize of output 20 [2022-11-23 14:32:47,468 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:47,468 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 38 treesize of output 37 [2022-11-23 14:32:47,485 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 20 treesize of output 22 [2022-11-23 14:32:47,619 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:32:47,620 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 38 treesize of output 37 [2022-11-23 14:32:47,634 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 20 treesize of output 22 [2022-11-23 14:32:47,777 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-23 14:32:47,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:47,782 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 1 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:32:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:32:47,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:32:48,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1020) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_976) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))) (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1019))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))))) is different from false [2022-11-23 14:32:48,142 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1019))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1020) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1019) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_976) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2) (_ bv0 32))))) is different from false [2022-11-23 14:32:48,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_#t~malloc13#1.base|))) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_1020 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (_ BitVec 32)) (v_ArrVal_976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset| v_ArrVal_1017)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1020) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_976) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (forall ((v_ArrVal_975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_1019))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_975)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))) is different from false [2022-11-23 14:32:49,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:32:49,424 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 100 treesize of output 124 [2022-11-23 14:32:50,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 14:32:50,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075720991] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:32:50,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:32:50,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13, 14, 14, 13] total 41 [2022-11-23 14:32:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164783785] [2022-11-23 14:32:50,337 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:32:50,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-23 14:32:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:32:50,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-23 14:32:50,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=643, Unknown=62, NotChecked=780, Total=1640 [2022-11-23 14:32:50,339 INFO L87 Difference]: Start difference. First operand 318 states and 384 transitions. Second operand has 41 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:32:59,454 INFO L93 Difference]: Finished difference Result 530 states and 628 transitions. [2022-11-23 14:32:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 14:32:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 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-23 14:32:59,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:32:59,457 INFO L225 Difference]: With dead ends: 530 [2022-11-23 14:32:59,457 INFO L226 Difference]: Without dead ends: 530 [2022-11-23 14:32:59,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 140 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=365, Invalid=1098, Unknown=67, NotChecked=1020, Total=2550 [2022-11-23 14:32:59,459 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 259 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 3792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 2318 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:32:59,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1538 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1422 Invalid, 2 Unknown, 2318 Unchecked, 6.4s Time] [2022-11-23 14:32:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-11-23 14:32:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 300. [2022-11-23 14:32:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 258 states have (on average 1.372093023255814) internal successors, (354), 299 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 354 transitions. [2022-11-23 14:32:59,480 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 354 transitions. Word has length 32 [2022-11-23 14:32:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:32:59,481 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 354 transitions. [2022-11-23 14:32:59,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 41 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:32:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 354 transitions. [2022-11-23 14:32:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:32:59,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:32:59,482 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] [2022-11-23 14:32:59,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-23 14:32:59,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 14:32:59,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-11-23 14:33:00,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:33:00,089 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:33:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:33:00,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2089686132, now seen corresponding path program 1 times [2022-11-23 14:33:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:33:00,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069363354] [2022-11-23 14:33:00,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:33:00,090 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-23 14:33:00,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:33:00,091 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:33:00,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Waiting until timeout for monitored process [2022-11-23 14:33:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:33:00,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-23 14:33:00,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:33:00,318 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-23 14:33:00,334 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 6 treesize of output 5 [2022-11-23 14:33:00,339 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 6 treesize of output 5 [2022-11-23 14:33:00,745 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:33:00,745 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-23 14:33:00,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:33:00,817 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 21 treesize of output 20 [2022-11-23 14:33:00,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:33:00,845 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-23 14:33:01,082 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:01,082 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 42 treesize of output 41 [2022-11-23 14:33:01,099 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 20 treesize of output 22 [2022-11-23 14:33:01,254 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:01,254 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 42 treesize of output 41 [2022-11-23 14:33:01,265 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 20 treesize of output 22 [2022-11-23 14:33:01,466 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 25 treesize of output 11 [2022-11-23 14:33:01,470 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-23 14:33:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:01,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:33:01,859 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_1080) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_1081) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-23 14:33:01,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))))) (and (forall ((v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1081) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1080) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-11-23 14:33:01,920 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_1078) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1080) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_1079))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1081)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:33:01,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1081)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1078) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1079) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1080) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-23 14:33:02,027 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc18#1.base|)))) (and (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1081)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1075 (_ BitVec 32)) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_1075)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1078) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1079) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1080) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-23 14:33:04,083 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_25|))) (forall ((v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 |v_ULTIMATE.start_main_#t~malloc18#1.base_25|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_25| v_ArrVal_1079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1081)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_25|))) (forall ((v_ArrVal_1078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1075 (_ BitVec 32)) (v_ArrVal_1080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_1075)) |v_ULTIMATE.start_main_#t~malloc18#1.base_25| v_ArrVal_1078) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse2 .cse1 |v_ULTIMATE.start_main_#t~malloc18#1.base_25|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_25| v_ArrVal_1079) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1080) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))))) is different from false [2022-11-23 14:33:09,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:09,045 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 52 [2022-11-23 14:33:09,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:09,072 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2022-11-23 14:33:09,089 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 230 treesize of output 168 [2022-11-23 14:33:09,098 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 158 treesize of output 150 [2022-11-23 14:33:09,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 78 treesize of output 74 [2022-11-23 14:33:09,115 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 152 treesize of output 146 [2022-11-23 14:33:09,123 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 126 treesize of output 102 [2022-11-23 14:33:09,162 INFO L321 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-11-23 14:33:09,162 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2022-11-23 14:33:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:09,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:33:09,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069363354] [2022-11-23 14:33:09,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069363354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:33:09,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [412527704] [2022-11-23 14:33:09,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:33:09,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:33:09,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:33:09,172 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:33:09,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-23 14:33:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:33:09,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:33:09,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:33:09,590 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-23 14:33:09,691 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-23 14:33:10,379 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:33:10,379 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-23 14:33:10,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:33:10,524 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 21 treesize of output 20 [2022-11-23 14:33:10,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:33:10,561 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-23 14:33:10,916 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:10,916 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 42 treesize of output 41 [2022-11-23 14:33:10,929 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 20 treesize of output 22 [2022-11-23 14:33:11,156 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:11,156 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 42 treesize of output 41 [2022-11-23 14:33:11,170 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 20 treesize of output 22 [2022-11-23 14:33:11,475 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-23 14:33:11,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:11,482 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 1 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:33:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:11,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:33:11,619 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-23 14:33:11,640 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))))) (and (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1140) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1139) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:33:11,680 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_1138) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1139) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_1137))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1140)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:33:11,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1138) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1137) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1139) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1137))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1140)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-23 14:33:11,796 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc18#1.base|)))) (and (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1137))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1140)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1135 (_ BitVec 32)) (v_ArrVal_1137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 v_ArrVal_1135)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1138) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1137) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1139) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-23 14:33:16,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:16,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 119 [2022-11-23 14:33:16,738 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 0 case distinctions, treesize of input 159 treesize of output 138 [2022-11-23 14:33:16,744 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 138 treesize of output 116 [2022-11-23 14:33:16,751 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 111 treesize of output 107 [2022-11-23 14:33:16,849 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:16,850 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 453 treesize of output 303 [2022-11-23 14:33:16,891 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:16,891 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 274 treesize of output 257 [2022-11-23 14:33:16,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 238 [2022-11-23 14:33:26,629 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 66 DAG size of output: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:33:26,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 8 treesize of output 4 [2022-11-23 14:33:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:26,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [412527704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:33:26,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784523561] [2022-11-23 14:33:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:33:26,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:33:26,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:33:26,858 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:33:26,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-23 14:33:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:33:27,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-23 14:33:27,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:33:27,532 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:33:27,532 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-23 14:33:27,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:33:27,566 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-23 14:33:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:33:27,579 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 21 treesize of output 20 [2022-11-23 14:33:27,713 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:27,714 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 42 treesize of output 41 [2022-11-23 14:33:27,726 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 20 treesize of output 22 [2022-11-23 14:33:27,851 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:27,851 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 42 treesize of output 41 [2022-11-23 14:33:27,867 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 20 treesize of output 22 [2022-11-23 14:33:27,964 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-23 14:33:27,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:27,969 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 1 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 14:33:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:28,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:33:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784523561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:33:28,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-11-23 14:33:28,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [16, 18, 16, 18] total 51 [2022-11-23 14:33:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815611522] [2022-11-23 14:33:28,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:33:28,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 14:33:28,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:33:28,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 14:33:28,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1320, Unknown=34, NotChecked=946, Total=2550 [2022-11-23 14:33:28,021 INFO L87 Difference]: Start difference. First operand 300 states and 354 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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-23 14:33:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:33:31,967 INFO L93 Difference]: Finished difference Result 387 states and 447 transitions. [2022-11-23 14:33:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 14:33:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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 34 [2022-11-23 14:33:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:33:31,969 INFO L225 Difference]: With dead ends: 387 [2022-11-23 14:33:31,969 INFO L226 Difference]: Without dead ends: 387 [2022-11-23 14:33:31,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=666, Invalid=2650, Unknown=34, NotChecked=1342, Total=4692 [2022-11-23 14:33:31,971 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 309 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:33:31,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 829 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-23 14:33:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-23 14:33:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 292. [2022-11-23 14:33:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 250 states have (on average 1.372) internal successors, (343), 291 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:33:31,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 343 transitions. [2022-11-23 14:33:31,979 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 343 transitions. Word has length 34 [2022-11-23 14:33:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:33:31,979 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 343 transitions. [2022-11-23 14:33:31,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 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-23 14:33:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 343 transitions. [2022-11-23 14:33:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:33:31,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:33:31,981 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] [2022-11-23 14:33:31,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-23 14:33:32,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2022-11-23 14:33:32,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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)] Ended with exit code 0 [2022-11-23 14:33:32,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:33:32,587 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:33:32,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:33:32,588 INFO L85 PathProgramCache]: Analyzing trace with hash 742188428, now seen corresponding path program 1 times [2022-11-23 14:33:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:33:32,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68985536] [2022-11-23 14:33:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:33:32,589 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-23 14:33:32,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:33:32,590 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:33:32,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:33:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:33:32,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:33:32,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:33:32,796 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-23 14:33:32,941 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:33:32,941 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-23 14:33:33,006 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-23 14:33:33,023 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-23 14:33:33,224 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:33,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 40 treesize of output 39 [2022-11-23 14:33:33,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 18 treesize of output 20 [2022-11-23 14:33:33,378 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:33:33,378 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 40 treesize of output 39 [2022-11-23 14:33:33,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:33:33,561 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-23 14:33:33,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 48 [2022-11-23 14:33:33,697 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 35 treesize of output 19 [2022-11-23 14:33:33,704 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 15 treesize of output 7 [2022-11-23 14:33:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:33:34,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:33:34,847 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1253) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1254) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_22|) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse0) (_ bv1 1)) (_ bv0 1)))))) is different from false [2022-11-23 14:33:34,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1254) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse0) (_ bv1 1))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_22|)))) (forall ((v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1253) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))) is different from false [2022-11-23 14:33:34,927 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1251))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1254)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse0)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| .cse0)))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1252) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1251) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1253) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-23 14:33:34,963 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1253 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1252) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1251) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1253) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1251))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1254)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_22|) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse1)) (_ bv0 1))))))) is different from false [2022-11-23 14:33:35,009 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:35,010 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 80 treesize of output 56 [2022-11-23 14:33:35,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:35,042 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 258 [2022-11-23 14:33:35,054 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 243 treesize of output 235 [2022-11-23 14:33:35,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:35,088 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 235 treesize of output 223 [2022-11-23 14:33:48,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:48,851 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 36 treesize of output 37 [2022-11-23 14:33:48,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:48,870 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 28 treesize of output 29 [2022-11-23 14:33:48,877 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 50 treesize of output 42 [2022-11-23 14:33:48,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:33:48,904 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 99 [2022-11-23 14:33:48,914 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 60 treesize of output 52 [2022-11-23 14:33:48,920 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 76 treesize of output 70 [2022-11-23 14:33:48,929 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 48 treesize of output 46 [2022-11-23 14:34:07,360 WARN L233 SmtUtils]: Spent 16.47s on a formula simplification. DAG size of input: 245 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:34:07,627 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-23 14:34:07,627 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:34:07,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68985536] [2022-11-23 14:34:07,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68985536] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:34:07,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1393018031] [2022-11-23 14:34:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:34:07,628 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:34:07,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:34:07,629 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:34:07,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-23 14:34:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:34:08,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 14:34:08,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:34:08,077 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 14:34:08,077 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-23 14:34:08,458 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-23 14:34:08,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-11-23 14:34:08,653 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-23 14:34:09,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:34:09,082 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 45 treesize of output 42 [2022-11-23 14:34:09,386 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:34:09,386 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 45 treesize of output 42 [2022-11-23 14:34:09,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:34:09,762 INFO L321 Elim1Store]: treesize reduction 34, result has 40.4 percent of original size [2022-11-23 14:34:09,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 56 [2022-11-23 14:34:10,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 71 [2022-11-23 14:34:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:34:11,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:34:12,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1310 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_24| (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24|)) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24| v_ArrVal_1310) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1)))) is different from false [2022-11-23 14:34:12,043 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1310 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_24| (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24|)) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24| v_ArrVal_1310) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1309) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))))) is different from false [2022-11-23 14:34:12,081 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1310 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_24| (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24|)) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24| v_ArrVal_1310) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1309)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))))) is different from false [2022-11-23 14:34:12,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1310 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_24| (_ BitVec 32))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24|)) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_24| v_ArrVal_1310) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1309)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1)))) is different from false [2022-11-23 14:34:12,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:34:12,140 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 43 treesize of output 36 [2022-11-23 14:34:12,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:34:12,170 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 292 treesize of output 267 [2022-11-23 14:34:12,181 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 252 treesize of output 244 [2022-11-23 14:34:12,210 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:34:12,210 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 244 treesize of output 236 [2022-11-23 14:34:41,767 WARN L233 SmtUtils]: Spent 12.00s on a formula simplification. DAG size of input: 328 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:35:06,709 WARN L233 SmtUtils]: Spent 10.84s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:35:12,663 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-23 14:35:12,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1393018031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:35:12,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196412043] [2022-11-23 14:35:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:35:12,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:35:12,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:35:12,672 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:35:12,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-23 14:35:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:35:12,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-23 14:35:12,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:35:13,081 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-23 14:35:13,081 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-23 14:35:13,117 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-23 14:35:13,144 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-23 14:35:13,247 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:35:13,247 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 40 treesize of output 39 [2022-11-23 14:35:13,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:35:13,387 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:35:13,387 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 40 treesize of output 39 [2022-11-23 14:35:13,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:35:13,560 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-23 14:35:13,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 48 [2022-11-23 14:35:13,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 35 treesize of output 19 [2022-11-23 14:35:13,641 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 15 treesize of output 7 [2022-11-23 14:35:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:35:13,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:35:14,285 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1255 (_ BitVec 1)) (v_ArrVal_1366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1366) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_22|) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse0) (_ bv1 1)))))) (forall ((v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1367) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-23 14:35:14,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1255 (_ BitVec 1)) (v_ArrVal_1366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1366) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse0) (_ bv1 1))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_22|)))) (forall ((v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1367) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:35:14,365 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1365) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1364) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1367) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (_ BitVec 1)) (v_ArrVal_1366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1364))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1366)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse0) (_ bv1 1)) (_ bv0 1)) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_22|))))) is different from false [2022-11-23 14:35:14,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1367 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1365) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1364) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1367) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1255 (_ BitVec 1)) (v_ArrVal_1366 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_22| (_ BitVec 32))) (let ((.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1364))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1366)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_22|) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_22| v_ArrVal_1255) .cse1)))))))) is different from false [2022-11-23 14:35:14,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:35:14,439 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 36 treesize of output 37 [2022-11-23 14:35:14,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:35:14,450 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 28 treesize of output 29 [2022-11-23 14:35:14,455 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 50 treesize of output 42 [2022-11-23 14:35:14,480 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:35:14,481 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 99 [2022-11-23 14:35:14,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-11-23 14:35:14,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 76 treesize of output 70 [2022-11-23 14:35:14,504 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 48 treesize of output 46 [2022-11-23 14:35:14,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:35:14,631 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 80 treesize of output 56 [2022-11-23 14:35:14,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:35:14,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:35:14,639 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2022-11-23 14:35:14,648 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 26 treesize of output 22 [2022-11-23 14:35:15,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:35:15,044 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 30 treesize of output 54 [2022-11-23 14:35:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:35:15,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196412043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:35:15,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-23 14:35:15,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12, 13, 13, 14] total 52 [2022-11-23 14:35:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905915505] [2022-11-23 14:35:15,079 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-23 14:35:15,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-23 14:35:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 14:35:15,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-23 14:35:15,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1428, Unknown=19, NotChecked=1068, Total=2756 [2022-11-23 14:35:15,080 INFO L87 Difference]: Start difference. First operand 292 states and 343 transitions. Second operand has 53 states, 52 states have (on average 2.730769230769231) internal successors, (142), 53 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:35:56,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:35:56,232 INFO L93 Difference]: Finished difference Result 862 states and 1005 transitions. [2022-11-23 14:35:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-23 14:35:56,233 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.730769230769231) internal successors, (142), 53 states have internal predecessors, (142), 0 states have call successors, (0), 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 34 [2022-11-23 14:35:56,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:35:56,235 INFO L225 Difference]: With dead ends: 862 [2022-11-23 14:35:56,236 INFO L226 Difference]: Without dead ends: 862 [2022-11-23 14:35:56,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 144 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 99.2s TimeCoverageRelationStatistics Valid=1136, Invalid=5500, Unknown=54, NotChecked=2052, Total=8742 [2022-11-23 14:35:56,239 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 1256 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 2854 mSolverCounterSat, 123 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 7183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2854 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 4148 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:35:56,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1659 Invalid, 7183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2854 Invalid, 58 Unknown, 4148 Unchecked, 12.3s Time] [2022-11-23 14:35:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-11-23 14:35:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 331. [2022-11-23 14:35:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 289 states have (on average 1.3806228373702423) internal successors, (399), 330 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:35:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 399 transitions. [2022-11-23 14:35:56,249 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 399 transitions. Word has length 34 [2022-11-23 14:35:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:35:56,250 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 399 transitions. [2022-11-23 14:35:56,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.730769230769231) internal successors, (142), 53 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:35:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 399 transitions. [2022-11-23 14:35:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-23 14:35:56,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:35:56,251 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] [2022-11-23 14:35:56,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:35:56,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-11-23 14:35:56,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-23 14:35:56,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt [2022-11-23 14:35:56,864 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-23 14:35:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:35:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 742188429, now seen corresponding path program 1 times [2022-11-23 14:35:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 14:35:56,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629269367] [2022-11-23 14:35:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:35:56,865 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-23 14:35:56,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 14:35:56,866 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -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-23 14:35:56,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-23 14:35:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:35:57,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-23 14:35:57,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:35:57,123 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-23 14:35:57,288 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:35:57,289 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-23 14:35:57,312 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-23 14:35:57,368 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-23 14:35:57,380 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-23 14:35:57,595 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:35:57,595 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 38 treesize of output 37 [2022-11-23 14:35:57,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:35:57,746 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:35:57,746 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 38 treesize of output 37 [2022-11-23 14:35:57,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:35:57,919 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 14:35:57,919 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 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-23 14:35:58,033 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 17 [2022-11-23 14:35:58,040 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 15 treesize of output 7 [2022-11-23 14:35:58,450 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-23 14:35:58,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:36:00,185 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_27| (_ BitVec 32)) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1425) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_27|) (forall ((v_ArrVal_1427 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_27| v_ArrVal_1427) .cse0))))))) is different from false [2022-11-23 14:36:00,223 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_27| (_ BitVec 32)) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1425) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_27|) (forall ((v_ArrVal_1427 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_27| v_ArrVal_1427) .cse0)))))) (forall ((v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:36:00,294 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1424) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1423) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_27| (_ BitVec 32)) (v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1423))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 .cse0 v_ArrVal_1425) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((v_ArrVal_1427 (_ BitVec 32))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1424) .cse0 v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_27| v_ArrVal_1427) .cse1))) (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_27|))))))) is different from false [2022-11-23 14:36:00,374 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_27| (_ BitVec 32)) (v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1423))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 .cse1 v_ArrVal_1425) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((v_ArrVal_1427 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1424) .cse1 v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_27| v_ArrVal_1427) .cse2))) (= .cse2 |v_ULTIMATE.start_main_~#sentinel~0#1.base_27|)))))) (forall ((v_ArrVal_1423 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1424 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1424) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1423) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1426) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-23 14:36:00,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:00,427 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 36 treesize of output 37 [2022-11-23 14:36:00,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:00,440 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 28 treesize of output 29 [2022-11-23 14:36:00,447 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 50 treesize of output 42 [2022-11-23 14:36:00,472 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:00,472 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 99 [2022-11-23 14:36:00,481 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 60 treesize of output 52 [2022-11-23 14:36:00,488 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 76 treesize of output 70 [2022-11-23 14:36:00,495 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 48 treesize of output 46 [2022-11-23 14:36:00,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:00,600 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 76 treesize of output 77 [2022-11-23 14:36:00,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:00,628 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 105 treesize of output 73 [2022-11-23 14:36:00,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:36:00,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:36:00,638 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 73 [2022-11-23 14:36:00,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:36:00,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2022-11-23 14:36:00,661 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 26 treesize of output 22 [2022-11-23 14:36:02,095 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-23 14:36:02,096 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 14:36:02,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629269367] [2022-11-23 14:36:02,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629269367] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 14:36:02,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1308914168] [2022-11-23 14:36:02,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:36:02,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-23 14:36:02,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 [2022-11-23 14:36:02,097 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-23 14:36:02,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f2e1c7f6-2968-4980-924f-9602098a154d/bin/utaipan-Q6hlc19bkW/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-23 14:36:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:36:02,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-23 14:36:02,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:36:02,543 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-23 14:36:02,883 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-23 14:36:02,883 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-23 14:36:02,921 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-23 14:36:03,105 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-23 14:36:03,154 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-23 14:36:03,627 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:36:03,628 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 45 treesize of output 42 [2022-11-23 14:36:03,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:36:03,940 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 14:36:03,941 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 45 treesize of output 42 [2022-11-23 14:36:03,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 14:36:04,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:36:04,259 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 16 treesize of output 18 [2022-11-23 14:36:04,485 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-23 14:36:04,490 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 16 [2022-11-23 14:36:05,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-23 14:36:05,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:36:06,647 WARN L837 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_29| (_ BitVec 32)) (v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#sentinel~0#1.base_29|)) (forall ((v_ArrVal_1486 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_29| v_ArrVal_1486) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))))))) is different from false [2022-11-23 14:36:06,696 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (or (forall ((v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1484) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_29| (_ BitVec 32)) (v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1484 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (bvult |c_#StackHeapBarrier| |v_ULTIMATE.start_main_~#sentinel~0#1.base_29|)) (forall ((v_ArrVal_1486 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1484) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_29| v_ArrVal_1486) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1485) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))) is different from false [2022-11-23 14:36:10,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:10,589 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 76 treesize of output 77 [2022-11-23 14:36:10,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:10,609 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 68 treesize of output 53 [2022-11-23 14:36:10,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:10,664 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 680 treesize of output 615 [2022-11-23 14:36:10,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:10,755 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 1312 treesize of output 1255 [2022-11-23 14:36:10,776 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 1240 treesize of output 1192 [2022-11-23 14:36:10,792 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 1192 treesize of output 1144 [2022-11-23 14:36:10,807 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 1144 treesize of output 1128 [2022-11-23 14:36:10,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:36:10,865 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 1128 treesize of output 1036