./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 8393723b 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_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro --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 Automizer --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-8393723 [2022-11-18 20:45:09,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:45:09,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:45:09,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:45:09,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:45:09,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:45:09,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:45:09,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:45:09,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:45:09,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:45:09,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:45:09,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:45:09,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:45:09,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:45:09,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:45:09,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:45:09,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:45:09,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:45:09,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:45:09,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:45:09,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:45:09,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:45:09,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:45:09,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:45:09,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:45:09,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:45:09,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:45:09,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:45:09,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:45:09,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:45:09,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:45:09,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:45:09,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:45:09,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:45:09,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:45:09,142 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:45:09,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:45:09,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:45:09,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:45:09,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:45:09,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:45:09,147 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:45:09,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:45:09,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:45:09,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:45:09,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:45:09,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:45:09,204 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:45:09,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:45:09,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:45:09,206 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:45:09,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:45:09,207 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:45:09,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:45:09,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:45:09,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:45:09,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:45:09,209 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:45:09,209 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:45:09,209 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:45:09,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:45:09,210 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:45:09,210 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:45:09,210 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:45:09,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:45:09,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:45:09,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:45:09,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:45:09,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:45:09,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:45:09,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:45:09,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:45:09,213 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_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/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_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro 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 -> Automizer 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-18 20:45:09,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:45:09,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:45:09,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:45:09,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:45:09,647 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:45:09,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-18 20:45:09,739 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/840d2322d/6e389b25c83a4d4cb5958065c6b4a893/FLAG4e218fc90 [2022-11-18 20:45:10,468 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:45:10,469 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-18 20:45:10,493 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/840d2322d/6e389b25c83a4d4cb5958065c6b4a893/FLAG4e218fc90 [2022-11-18 20:45:10,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/840d2322d/6e389b25c83a4d4cb5958065c6b4a893 [2022-11-18 20:45:10,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:45:10,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:45:10,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:45:10,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:45:10,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:45:10,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:45:10" (1/1) ... [2022-11-18 20:45:10,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@652ad2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:10, skipping insertion in model container [2022-11-18 20:45:10,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:45:10" (1/1) ... [2022-11-18 20:45:10,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:45:10,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:45:11,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:45:11,246 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-18 20:45:11,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65031fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:11, skipping insertion in model container [2022-11-18 20:45:11,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:45:11,248 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-18 20:45:11,251 INFO L158 Benchmark]: Toolchain (without parser) took 531.24ms. Allocated memory is still 104.9MB. Free memory was 72.7MB in the beginning and 78.0MB in the end (delta: -5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:45:11,252 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 104.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:45:11,253 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.37ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 78.0MB in the end (delta: -5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:45:11,254 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.39ms. Allocated memory is still 104.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.37ms. Allocated memory is still 104.9MB. Free memory was 72.4MB in the beginning and 78.0MB in the end (delta: -5.5MB). Peak memory consumption was 6.3MB. 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_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro --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 Automizer --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-8393723 [2022-11-18 20:45:13,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:45:13,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:45:13,389 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:45:13,390 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:45:13,391 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:45:13,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:45:13,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:45:13,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:45:13,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:45:13,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:45:13,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:45:13,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:45:13,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:45:13,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:45:13,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:45:13,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:45:13,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:45:13,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:45:13,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:45:13,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:45:13,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:45:13,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:45:13,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:45:13,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:45:13,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:45:13,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:45:13,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:45:13,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:45:13,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:45:13,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:45:13,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:45:13,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:45:13,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:45:13,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:45:13,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:45:13,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:45:13,428 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:45:13,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:45:13,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:45:13,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:45:13,431 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-18 20:45:13,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:45:13,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:45:13,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:45:13,487 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:45:13,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:45:13,488 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:45:13,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:45:13,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:45:13,490 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:45:13,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:45:13,492 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:45:13,492 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:45:13,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:45:13,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:45:13,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:45:13,493 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:45:13,493 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:45:13,493 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:45:13,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:45:13,494 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:45:13,494 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:45:13,494 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:45:13,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:45:13,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:45:13,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:45:13,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:45:13,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:45:13,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:45:13,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:45:13,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:45:13,496 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:45:13,496 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:45:13,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:45:13,497 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_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/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_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro 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 -> Automizer 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-18 20:45:13,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:45:13,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:45:13,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:45:13,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:45:13,934 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:45:13,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-18 20:45:14,010 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/15ee515bf/ca456cf0e4ba4dbd923846eda40e344b/FLAG6d7da8860 [2022-11-18 20:45:14,618 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:45:14,618 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2022-11-18 20:45:14,635 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/15ee515bf/ca456cf0e4ba4dbd923846eda40e344b/FLAG6d7da8860 [2022-11-18 20:45:14,925 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/data/15ee515bf/ca456cf0e4ba4dbd923846eda40e344b [2022-11-18 20:45:14,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:45:14,929 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:45:14,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:45:14,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:45:14,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:45:14,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:45:14" (1/1) ... [2022-11-18 20:45:14,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0f83a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:14, skipping insertion in model container [2022-11-18 20:45:14,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:45:14" (1/1) ... [2022-11-18 20:45:14,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:45:14,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:45:15,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:45:15,390 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:45:15,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:45:15,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:45:15,459 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:45:15,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:45:15,544 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:45:15,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15 WrapperNode [2022-11-18 20:45:15,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:45:15,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:45:15,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:45:15,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:45:15,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,604 INFO L138 Inliner]: procedures = 125, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 155 [2022-11-18 20:45:15,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:45:15,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:45:15,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:45:15,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:45:15,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,637 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:45:15,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:45:15,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:45:15,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:45:15,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (1/1) ... [2022-11-18 20:45:15,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:45:15,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:45:15,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:45:15,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:45:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:45:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:45:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:45:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:45:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:45:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:45:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:45:15,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:45:15,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:45:15,870 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:45:15,887 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:45:16,860 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:45:16,868 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:45:16,868 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:45:16,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:45:16 BoogieIcfgContainer [2022-11-18 20:45:16,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:45:16,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:45:16,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:45:16,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:45:16,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:45:14" (1/3) ... [2022-11-18 20:45:16,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c33aa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:45:16, skipping insertion in model container [2022-11-18 20:45:16,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:45:15" (2/3) ... [2022-11-18 20:45:16,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c33aa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:45:16, skipping insertion in model container [2022-11-18 20:45:16,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:45:16" (3/3) ... [2022-11-18 20:45:16,893 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2022-11-18 20:45:16,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:45:16,913 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-11-18 20:45:16,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:45:17,005 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;@550d7e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:45:17,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-11-18 20:45:17,012 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-18 20:45:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:45:17,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:17,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:45:17,025 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-18 20:45:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-18 20:45:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:17,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283448537] [2022-11-18 20:45:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:17,050 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-18 20:45:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:17,057 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:17,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:17,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:45:17,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:17,259 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-18 20:45:17,272 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-18 20:45:17,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:17,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:17,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283448537] [2022-11-18 20:45:17,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283448537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:17,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:17,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:45:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000567437] [2022-11-18 20:45:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:17,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:45:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:45:17,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:45:17,330 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-18 20:45:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:17,710 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-11-18 20:45:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:45:17,712 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-18 20:45:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:17,721 INFO L225 Difference]: With dead ends: 169 [2022-11-18 20:45:17,722 INFO L226 Difference]: Without dead ends: 167 [2022-11-18 20:45:17,723 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-18 20:45:17,727 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 117 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-18 20:45:17,728 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-18 20:45:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-18 20:45:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2022-11-18 20:45:17,787 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-18 20:45:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2022-11-18 20:45:17,791 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2022-11-18 20:45:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:17,791 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2022-11-18 20:45:17,791 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-18 20:45:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2022-11-18 20:45:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:45:17,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:17,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:45:17,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:17,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:17,993 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-18 20:45:17,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:17,994 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-18 20:45:17,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:17,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131945830] [2022-11-18 20:45:17,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:17,995 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-18 20:45:17,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:18,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:18,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:18,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:45:18,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:18,077 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-18 20:45:18,088 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-18 20:45:18,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:18,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:18,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131945830] [2022-11-18 20:45:18,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131945830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:18,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:18,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:45:18,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948480463] [2022-11-18 20:45:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:18,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:45:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:45:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:45:18,097 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-18 20:45:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:18,512 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-11-18 20:45:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:45:18,514 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-18 20:45:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:18,515 INFO L225 Difference]: With dead ends: 149 [2022-11-18 20:45:18,515 INFO L226 Difference]: Without dead ends: 149 [2022-11-18 20:45:18,516 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-18 20:45:18,517 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.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:18,517 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.4s Time] [2022-11-18 20:45:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-18 20:45:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-18 20:45:18,532 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-18 20:45:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-11-18 20:45:18,540 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 3 [2022-11-18 20:45:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:18,540 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-11-18 20:45:18,540 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-18 20:45:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-11-18 20:45:18,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:45:18,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:18,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:45:18,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-18 20:45:18,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:18,742 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-18 20:45:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash 889446412, now seen corresponding path program 1 times [2022-11-18 20:45:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:18,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971462936] [2022-11-18 20:45:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:18,744 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-18 20:45:18,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:18,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:18,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:18,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:45:18,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:18,830 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-18 20:45:18,855 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-18 20:45:18,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:18,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:18,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971462936] [2022-11-18 20:45:18,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971462936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:18,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:18,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:45:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363238305] [2022-11-18 20:45:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:18,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:45:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:45:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:45:18,858 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-18 20:45:19,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:19,334 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2022-11-18 20:45:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:45:19,334 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-18 20:45:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:19,336 INFO L225 Difference]: With dead ends: 159 [2022-11-18 20:45:19,336 INFO L226 Difference]: Without dead ends: 159 [2022-11-18 20:45:19,336 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-18 20:45:19,337 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 206 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-18 20:45:19,337 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-18 20:45:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-18 20:45:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2022-11-18 20:45:19,345 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-18 20:45:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2022-11-18 20:45:19,346 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 6 [2022-11-18 20:45:19,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:19,347 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2022-11-18 20:45:19,347 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-18 20:45:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2022-11-18 20:45:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:45:19,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:19,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:45:19,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:19,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:19,560 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-18 20:45:19,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash 889446413, now seen corresponding path program 1 times [2022-11-18 20:45:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:19,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205014730] [2022-11-18 20:45:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:19,562 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-18 20:45:19,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:19,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:19,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:19,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:45:19,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:19,665 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-18 20:45:19,716 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-18 20:45:19,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:19,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205014730] [2022-11-18 20:45:19,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205014730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:19,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:19,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:45:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352958540] [2022-11-18 20:45:19,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:19,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:45:19,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:19,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:45:19,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:45:19,732 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-18 20:45:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:20,351 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2022-11-18 20:45:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:45:20,352 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-18 20:45:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:20,354 INFO L225 Difference]: With dead ends: 185 [2022-11-18 20:45:20,355 INFO L226 Difference]: Without dead ends: 185 [2022-11-18 20:45:20,355 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-18 20:45:20,356 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-18 20:45:20,356 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-18 20:45:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-18 20:45:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2022-11-18 20:45:20,366 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-18 20:45:20,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2022-11-18 20:45:20,367 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 6 [2022-11-18 20:45:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:20,367 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2022-11-18 20:45:20,368 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-18 20:45:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2022-11-18 20:45:20,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 20:45:20,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:20,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:20,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:20,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:20,580 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-18 20:45:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1845826674, now seen corresponding path program 1 times [2022-11-18 20:45:20,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:20,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675735234] [2022-11-18 20:45:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:20,584 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-18 20:45:20,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:20,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:20,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:20,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:45:20,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:20,666 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-18 20:45:20,712 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:45:20,713 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-18 20:45:20,724 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-18 20:45:20,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:20,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:20,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675735234] [2022-11-18 20:45:20,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675735234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:20,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:20,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:45:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343247947] [2022-11-18 20:45:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:20,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:45:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:45:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:45:20,730 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-18 20:45:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:21,111 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-11-18 20:45:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:45:21,112 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-18 20:45:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:21,113 INFO L225 Difference]: With dead ends: 182 [2022-11-18 20:45:21,113 INFO L226 Difference]: Without dead ends: 182 [2022-11-18 20:45:21,113 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-18 20:45:21,114 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-18 20:45:21,115 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-18 20:45:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-18 20:45:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2022-11-18 20:45:21,124 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-18 20:45:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2022-11-18 20:45:21,125 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 9 [2022-11-18 20:45:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:21,125 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2022-11-18 20:45:21,126 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-18 20:45:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2022-11-18 20:45:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:45:21,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:21,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:21,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:21,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:21,339 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-18 20:45:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1772597097, now seen corresponding path program 1 times [2022-11-18 20:45:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:21,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241587045] [2022-11-18 20:45:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:21,340 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-18 20:45:21,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:21,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:21,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:21,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:45:21,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:21,435 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-18 20:45:21,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:21,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:21,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241587045] [2022-11-18 20:45:21,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241587045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:21,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:21,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:45:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529405895] [2022-11-18 20:45:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:21,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:45:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:45:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:45:21,438 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-18 20:45:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:21,450 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2022-11-18 20:45:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:45:21,451 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-18 20:45:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:21,452 INFO L225 Difference]: With dead ends: 167 [2022-11-18 20:45:21,452 INFO L226 Difference]: Without dead ends: 167 [2022-11-18 20:45:21,452 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-18 20:45:21,453 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-18 20:45:21,454 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-18 20:45:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-18 20:45:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-11-18 20:45:21,460 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-18 20:45:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-11-18 20:45:21,462 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 13 [2022-11-18 20:45:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:21,462 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-11-18 20:45:21,462 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-18 20:45:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-11-18 20:45:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:45:21,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:21,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:21,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-18 20:45:21,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:21,664 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-18 20:45:21,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:21,665 INFO L85 PathProgramCache]: Analyzing trace with hash 131239230, now seen corresponding path program 1 times [2022-11-18 20:45:21,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:21,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564853684] [2022-11-18 20:45:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:21,665 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-18 20:45:21,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:21,666 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:21,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:21,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:45:21,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:21,771 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-18 20:45:21,786 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-18 20:45:21,806 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-18 20:45:21,815 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-18 20:45:21,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:21,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:21,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564853684] [2022-11-18 20:45:21,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564853684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:21,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:21,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:45:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190197988] [2022-11-18 20:45:21,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:21,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:45:21,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:21,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:45:21,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:45:21,818 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-18 20:45:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:22,302 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2022-11-18 20:45:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:45:22,303 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-18 20:45:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:22,303 INFO L225 Difference]: With dead ends: 166 [2022-11-18 20:45:22,304 INFO L226 Difference]: Without dead ends: 166 [2022-11-18 20:45:22,304 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-18 20:45:22,304 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.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:22,305 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.4s Time] [2022-11-18 20:45:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-18 20:45:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-18 20:45:22,309 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-18 20:45:22,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2022-11-18 20:45:22,319 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 15 [2022-11-18 20:45:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:22,320 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2022-11-18 20:45:22,320 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-18 20:45:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2022-11-18 20:45:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:45:22,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:22,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:22,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:22,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:22,537 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-18 20:45:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 131239231, now seen corresponding path program 1 times [2022-11-18 20:45:22,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:22,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655615759] [2022-11-18 20:45:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:22,538 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-18 20:45:22,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:22,539 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:22,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:22,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:45:22,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:22,662 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-18 20:45:22,720 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-18 20:45:22,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:45:22,782 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-18 20:45:22,797 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-18 20:45:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:45:22,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:22,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:22,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655615759] [2022-11-18 20:45:22,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655615759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:22,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:22,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:45:22,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621392627] [2022-11-18 20:45:22,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:22,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:45:22,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:22,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:45:22,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:45:22,825 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-18 20:45:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:23,668 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-11-18 20:45:23,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:45:23,669 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-18 20:45:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:23,670 INFO L225 Difference]: With dead ends: 165 [2022-11-18 20:45:23,671 INFO L226 Difference]: Without dead ends: 165 [2022-11-18 20:45:23,671 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-18 20:45:23,672 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:23,673 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.8s Time] [2022-11-18 20:45:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-18 20:45:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-18 20:45:23,679 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-18 20:45:23,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2022-11-18 20:45:23,680 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 15 [2022-11-18 20:45:23,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:23,681 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2022-11-18 20:45:23,681 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-18 20:45:23,681 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2022-11-18 20:45:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 20:45:23,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:23,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:23,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 20:45:23,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:23,902 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-18 20:45:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:23,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1899349350, now seen corresponding path program 1 times [2022-11-18 20:45:23,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:23,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873348727] [2022-11-18 20:45:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:23,904 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-18 20:45:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:23,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:23,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:23,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:45:23,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:24,013 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-18 20:45:24,022 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-18 20:45:24,119 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-18 20:45:24,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 20:45:24,168 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-18 20:45:24,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:24,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:24,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873348727] [2022-11-18 20:45:24,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873348727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:24,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:24,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:45:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412790071] [2022-11-18 20:45:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:24,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:45:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:45:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:45:24,173 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-18 20:45:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:24,943 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2022-11-18 20:45:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:45:24,944 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-18 20:45:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:24,945 INFO L225 Difference]: With dead ends: 203 [2022-11-18 20:45:24,945 INFO L226 Difference]: Without dead ends: 203 [2022-11-18 20:45:24,946 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-18 20:45:24,946 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-18 20:45:24,946 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-18 20:45:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-18 20:45:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2022-11-18 20:45:24,950 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-18 20:45:24,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2022-11-18 20:45:24,951 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 15 [2022-11-18 20:45:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:24,951 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2022-11-18 20:45:24,952 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-18 20:45:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2022-11-18 20:45:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:45:24,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:24,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:24,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:25,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:25,153 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-18 20:45:25,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:25,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751881, now seen corresponding path program 1 times [2022-11-18 20:45:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:25,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913712805] [2022-11-18 20:45:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:25,154 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-18 20:45:25,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:25,156 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:25,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:25,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:45:25,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:25,258 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-18 20:45:25,275 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-18 20:45:25,300 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-18 20:45:25,310 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-18 20:45:25,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:25,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:25,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913712805] [2022-11-18 20:45:25,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913712805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:25,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:25,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:45:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797791313] [2022-11-18 20:45:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:25,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:45:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:25,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:45:25,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:45:25,313 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-18 20:45:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:25,894 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2022-11-18 20:45:25,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:45:25,895 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-18 20:45:25,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:25,896 INFO L225 Difference]: With dead ends: 175 [2022-11-18 20:45:25,896 INFO L226 Difference]: Without dead ends: 175 [2022-11-18 20:45:25,896 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-18 20:45:25,897 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 7 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-18 20:45:25,897 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-18 20:45:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-18 20:45:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-18 20:45:25,902 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-18 20:45:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2022-11-18 20:45:25,903 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 17 [2022-11-18 20:45:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:25,903 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2022-11-18 20:45:25,903 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-18 20:45:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2022-11-18 20:45:25,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:45:25,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:25,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:25,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:45:26,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:26,105 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-18 20:45:26,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751880, now seen corresponding path program 1 times [2022-11-18 20:45:26,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:26,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782824773] [2022-11-18 20:45:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:26,106 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-18 20:45:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:26,107 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:26,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:26,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-18 20:45:26,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:26,223 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-18 20:45:26,255 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-18 20:45:26,266 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-18 20:45:26,320 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-18 20:45:26,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 19 treesize of output 7 [2022-11-18 20:45:26,356 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-18 20:45:26,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:26,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:26,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [782824773] [2022-11-18 20:45:26,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [782824773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:26,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:26,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:45:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187507074] [2022-11-18 20:45:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:26,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:45:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:45:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:45:26,359 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-18 20:45:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:27,096 INFO L93 Difference]: Finished difference Result 174 states and 196 transitions. [2022-11-18 20:45:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:45:27,097 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-18 20:45:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:27,098 INFO L225 Difference]: With dead ends: 174 [2022-11-18 20:45:27,098 INFO L226 Difference]: Without dead ends: 174 [2022-11-18 20:45:27,099 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-18 20:45:27,099 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:27,100 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.7s Time] [2022-11-18 20:45:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-11-18 20:45:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-11-18 20:45:27,104 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-18 20:45:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2022-11-18 20:45:27,105 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 17 [2022-11-18 20:45:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:27,106 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2022-11-18 20:45:27,106 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-18 20:45:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2022-11-18 20:45:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:45:27,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:27,107 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:27,119 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:27,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:27,317 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-18 20:45:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1696190880, now seen corresponding path program 1 times [2022-11-18 20:45:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:27,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519908159] [2022-11-18 20:45:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:27,319 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-18 20:45:27,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:27,320 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:27,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:27,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:45:27,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:27,462 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-18 20:45:27,469 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-18 20:45:27,491 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-18 20:45:27,502 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-18 20:45:27,552 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-18 20:45:27,562 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-18 20:45:27,633 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-18 20:45:27,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:27,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:27,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519908159] [2022-11-18 20:45:27,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519908159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:27,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:27,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:45:27,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411026947] [2022-11-18 20:45:27,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:27,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:45:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:45:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:45:27,636 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-18 20:45:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:28,497 INFO L93 Difference]: Finished difference Result 287 states and 315 transitions. [2022-11-18 20:45:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:45:28,501 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-18 20:45:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:28,502 INFO L225 Difference]: With dead ends: 287 [2022-11-18 20:45:28,503 INFO L226 Difference]: Without dead ends: 287 [2022-11-18 20:45:28,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:45:28,504 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 161 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:28,504 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.7s Time] [2022-11-18 20:45:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-18 20:45:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 184. [2022-11-18 20:45:28,510 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-18 20:45:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-11-18 20:45:28,511 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 17 [2022-11-18 20:45:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:28,511 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-11-18 20:45:28,512 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-18 20:45:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-11-18 20:45:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:45:28,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:28,513 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:28,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:28,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:28,726 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-18 20:45:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:28,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188958, now seen corresponding path program 1 times [2022-11-18 20:45:28,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:28,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409799287] [2022-11-18 20:45:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:28,727 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-18 20:45:28,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:28,728 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:28,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:28,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:45:28,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:28,881 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-18 20:45:28,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:28,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409799287] [2022-11-18 20:45:28,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409799287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:28,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:28,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:45:28,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383543035] [2022-11-18 20:45:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:28,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:45:28,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:28,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:45:28,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:45:28,884 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-18 20:45:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:29,443 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-11-18 20:45:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:45:29,444 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-18 20:45:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:29,445 INFO L225 Difference]: With dead ends: 225 [2022-11-18 20:45:29,445 INFO L226 Difference]: Without dead ends: 225 [2022-11-18 20:45:29,445 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-18 20:45:29,446 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 132 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:29,446 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.5s Time] [2022-11-18 20:45:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-18 20:45:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2022-11-18 20:45:29,451 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-18 20:45:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2022-11-18 20:45:29,452 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 17 [2022-11-18 20:45:29,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:29,453 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2022-11-18 20:45:29,453 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-18 20:45:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2022-11-18 20:45:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 20:45:29,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:29,461 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:29,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:29,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:29,662 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-18 20:45:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1696188959, now seen corresponding path program 1 times [2022-11-18 20:45:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:29,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9895270] [2022-11-18 20:45:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:29,663 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-18 20:45:29,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:29,665 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:29,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:29,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:45:29,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:29,917 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-18 20:45:29,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:29,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:29,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9895270] [2022-11-18 20:45:29,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9895270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:29,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:29,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:45:29,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519242534] [2022-11-18 20:45:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:29,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:45:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:45:29,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:45:29,920 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-18 20:45:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:31,010 INFO L93 Difference]: Finished difference Result 302 states and 335 transitions. [2022-11-18 20:45:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:45:31,011 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-18 20:45:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:31,012 INFO L225 Difference]: With dead ends: 302 [2022-11-18 20:45:31,013 INFO L226 Difference]: Without dead ends: 302 [2022-11-18 20:45:31,013 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-18 20:45:31,014 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 409 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:31,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 306 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:45:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-18 20:45:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 189. [2022-11-18 20:45:31,019 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-18 20:45:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2022-11-18 20:45:31,020 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 17 [2022-11-18 20:45:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:31,021 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2022-11-18 20:45:31,021 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-18 20:45:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2022-11-18 20:45:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:45:31,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:31,022 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-18 20:45:31,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:31,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:31,235 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-18 20:45:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:31,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705298, now seen corresponding path program 1 times [2022-11-18 20:45:31,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:31,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370790991] [2022-11-18 20:45:31,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:31,236 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-18 20:45:31,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:31,237 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:31,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:31,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:45:31,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:31,391 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-18 20:45:31,438 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:45:31,438 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-18 20:45:31,455 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-18 20:45:31,517 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-18 20:45:31,532 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-18 20:45:31,641 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:45:31,642 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-18 20:45:31,649 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-18 20:45:31,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 20:45:31,694 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-18 20:45:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:45:31,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:31,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:31,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370790991] [2022-11-18 20:45:31,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370790991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:31,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:31,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:45:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862570808] [2022-11-18 20:45:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:31,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:45:31,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:31,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:45:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:45:31,722 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-18 20:45:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:32,838 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2022-11-18 20:45:32,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:45:32,839 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-18 20:45:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:32,840 INFO L225 Difference]: With dead ends: 207 [2022-11-18 20:45:32,840 INFO L226 Difference]: Without dead ends: 207 [2022-11-18 20:45:32,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 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-18 20:45:32,841 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 184 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:32,842 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.9s Time] [2022-11-18 20:45:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-18 20:45:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2022-11-18 20:45:32,846 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-18 20:45:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2022-11-18 20:45:32,847 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 18 [2022-11-18 20:45:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:32,847 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2022-11-18 20:45:32,847 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-18 20:45:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2022-11-18 20:45:32,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:45:32,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:32,848 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-18 20:45:32,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:33,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:33,058 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-18 20:45:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705297, now seen corresponding path program 1 times [2022-11-18 20:45:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:33,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486793496] [2022-11-18 20:45:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:45:33,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:33,060 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:33,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:33,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:45:33,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:33,224 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:45:33,225 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-18 20:45:33,413 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-18 20:45:33,414 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-18 20:45:33,497 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-18 20:45:33,666 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:45:33,667 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-18 20:45:33,727 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-18 20:45:33,823 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-18 20:45:33,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:33,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:33,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486793496] [2022-11-18 20:45:33,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486793496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:33,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:33,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:45:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650263115] [2022-11-18 20:45:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:33,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:45:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:45:33,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:45:33,825 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-18 20:45:35,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:35,023 INFO L93 Difference]: Finished difference Result 206 states and 231 transitions. [2022-11-18 20:45:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:45:35,024 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-18 20:45:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:35,025 INFO L225 Difference]: With dead ends: 206 [2022-11-18 20:45:35,025 INFO L226 Difference]: Without dead ends: 206 [2022-11-18 20:45:35,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 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-18 20:45:35,026 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 321 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:35,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 220 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 339 Invalid, 0 Unknown, 92 Unchecked, 0.7s Time] [2022-11-18 20:45:35,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-18 20:45:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 187. [2022-11-18 20:45:35,030 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-18 20:45:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2022-11-18 20:45:35,031 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 18 [2022-11-18 20:45:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:35,031 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2022-11-18 20:45:35,032 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-18 20:45:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2022-11-18 20:45:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:45:35,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:35,032 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-18 20:45:35,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:35,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:35,233 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-18 20:45:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1042249152, now seen corresponding path program 1 times [2022-11-18 20:45:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:35,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731514274] [2022-11-18 20:45:35,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:35,234 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-18 20:45:35,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:35,234 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:35,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:35,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:45:35,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:35,450 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-18 20:45:35,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:45:35,500 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-18 20:45:35,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:35,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731514274] [2022-11-18 20:45:35,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731514274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:45:35,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:45:35,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-18 20:45:35,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845389904] [2022-11-18 20:45:35,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:45:35,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:45:35,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:35,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:45:35,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:45:35,504 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-18 20:45:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:36,006 INFO L93 Difference]: Finished difference Result 264 states and 290 transitions. [2022-11-18 20:45:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:45:36,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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 18 [2022-11-18 20:45:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:36,008 INFO L225 Difference]: With dead ends: 264 [2022-11-18 20:45:36,008 INFO L226 Difference]: Without dead ends: 264 [2022-11-18 20:45:36,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:45:36,009 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 311 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:36,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 467 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:45:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-18 20:45:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 186. [2022-11-18 20:45:36,014 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-18 20:45:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-11-18 20:45:36,014 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 18 [2022-11-18 20:45:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:36,015 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-11-18 20:45:36,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-18 20:45:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-11-18 20:45:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:45:36,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:36,016 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-18 20:45:36,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:36,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:36,229 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-18 20:45:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350413, now seen corresponding path program 1 times [2022-11-18 20:45:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:36,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274778297] [2022-11-18 20:45:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:36,230 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-18 20:45:36,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:36,232 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:36,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-18 20:45:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:36,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-18 20:45:36,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:36,392 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-18 20:45:36,392 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-18 20:45:36,596 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-11-18 20:45:36,596 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-18 20:45:36,664 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-18 20:45:36,871 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:45:36,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-18 20:45:36,933 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-18 20:45:37,030 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-18 20:45:37,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:37,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:37,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274778297] [2022-11-18 20:45:37,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274778297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:37,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:37,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:45:37,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868420529] [2022-11-18 20:45:37,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:37,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:45:37,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:37,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:45:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:45:37,032 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-18 20:45:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:38,367 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2022-11-18 20:45:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:45:38,368 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-18 20:45:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:38,369 INFO L225 Difference]: With dead ends: 205 [2022-11-18 20:45:38,369 INFO L226 Difference]: Without dead ends: 205 [2022-11-18 20:45:38,369 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-18 20:45:38,370 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 318 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:38,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 255 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 429 Invalid, 0 Unknown, 91 Unchecked, 0.9s Time] [2022-11-18 20:45:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-18 20:45:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2022-11-18 20:45:38,374 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-18 20:45:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2022-11-18 20:45:38,375 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 20 [2022-11-18 20:45:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:38,376 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2022-11-18 20:45:38,376 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-18 20:45:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2022-11-18 20:45:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:45:38,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:38,377 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-18 20:45:38,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-18 20:45:38,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:38,589 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-18 20:45:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:38,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350412, now seen corresponding path program 1 times [2022-11-18 20:45:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:38,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487217747] [2022-11-18 20:45:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:38,590 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-18 20:45:38,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:38,591 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:38,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:38,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-18 20:45:38,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:38,744 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-18 20:45:38,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 5 [2022-11-18 20:45:38,809 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:45:38,809 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-18 20:45:38,838 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-18 20:45:38,849 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-18 20:45:38,976 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:45:38,977 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-18 20:45:38,985 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-18 20:45:39,021 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-18 20:45:39,031 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-18 20:45:39,058 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-18 20:45:39,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:45:39,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487217747] [2022-11-18 20:45:39,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487217747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:45:39,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:45:39,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:45:39,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542688652] [2022-11-18 20:45:39,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:45:39,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:45:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:45:39,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:45:39,060 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-18 20:45:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:40,195 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2022-11-18 20:45:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:45:40,196 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-18 20:45:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:40,197 INFO L225 Difference]: With dead ends: 204 [2022-11-18 20:45:40,197 INFO L226 Difference]: Without dead ends: 204 [2022-11-18 20:45:40,197 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-18 20:45:40,198 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 173 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:40,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 194 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 20:45:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-18 20:45:40,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2022-11-18 20:45:40,202 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-18 20:45:40,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-11-18 20:45:40,203 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 20 [2022-11-18 20:45:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:40,204 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-11-18 20:45:40,204 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-18 20:45:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-11-18 20:45:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:45:40,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:40,205 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:45:40,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:40,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:40,418 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-18 20:45:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1776483090, now seen corresponding path program 1 times [2022-11-18 20:45:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:40,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503377726] [2022-11-18 20:45:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:40,419 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-18 20:45:40,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:40,420 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:40,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:40,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 20:45:40,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:40,577 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-18 20:45:40,584 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-18 20:45:40,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2022-11-18 20:45:40,715 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-18 20:45:40,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:45:40,789 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-18 20:45:40,797 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-18 20:45:40,880 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-18 20:45:40,886 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-18 20:45:40,984 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-18 20:45:40,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:45:41,135 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-18 20:45:41,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:45:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503377726] [2022-11-18 20:45:41,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503377726] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:45:41,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:45:41,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-11-18 20:45:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649162606] [2022-11-18 20:45:41,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:45:41,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:45:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:45:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:45:41,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:45:41,138 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:45:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:45:42,534 INFO L93 Difference]: Finished difference Result 224 states and 249 transitions. [2022-11-18 20:45:42,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:45:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-18 20:45:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:45:42,535 INFO L225 Difference]: With dead ends: 224 [2022-11-18 20:45:42,536 INFO L226 Difference]: Without dead ends: 224 [2022-11-18 20:45:42,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:45:42,538 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 72 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:45:42,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 831 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:45:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-18 20:45:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 193. [2022-11-18 20:45:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 192 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-18 20:45:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2022-11-18 20:45:42,550 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 26 [2022-11-18 20:45:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:45:42,551 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2022-11-18 20:45:42,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:45:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2022-11-18 20:45:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:45:42,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:45:42,553 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-18 20:45:42,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-18 20:45:42,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:42,761 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-18 20:45:42,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:45:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719994, now seen corresponding path program 1 times [2022-11-18 20:45:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:45:42,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346509690] [2022-11-18 20:45:42,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:45:42,762 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-18 20:45:42,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:45:42,764 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:42,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:45:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:45:42,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:45:42,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:45:42,953 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-18 20:45:43,072 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:45:43,073 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-18 20:45:43,121 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-18 20:45:43,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:45:43,281 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-18 20:45:43,379 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:45:43,379 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-18 20:45:43,532 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-18 20:45:43,620 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-18 20:45:43,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:45:43,758 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (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_539) |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-18 20:45:43,773 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (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))) v_ArrVal_539) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-18 20:45:43,800 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (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_538))) (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_539)) |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-18 20:45:43,820 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (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_538))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_539))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-18 20:45:43,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:45:43,845 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-18 20:45:43,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:45:43,871 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-18 20:45:43,883 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-18 20:45:43,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:45:43,906 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-18 20:46:10,451 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-18 20:46:10,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:46:10,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346509690] [2022-11-18 20:46:10,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346509690] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:46:10,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:46:10,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-11-18 20:46:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225605334] [2022-11-18 20:46:10,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:46:10,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:46:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:46:10,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:46:10,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=258, Unknown=11, NotChecked=148, Total=506 [2022-11-18 20:46:10,453 INFO L87 Difference]: Start difference. First operand 193 states and 215 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:46:12,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:17,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:19,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:46:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:25,160 INFO L93 Difference]: Finished difference Result 393 states and 450 transitions. [2022-11-18 20:46:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 20:46:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 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-18 20:46:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:25,162 INFO L225 Difference]: With dead ends: 393 [2022-11-18 20:46:25,163 INFO L226 Difference]: Without dead ends: 393 [2022-11-18 20:46:25,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=208, Invalid=496, Unknown=14, NotChecked=212, Total=930 [2022-11-18 20:46:25,164 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 517 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 66 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1364 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:25,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 686 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 688 Invalid, 2 Unknown, 1364 Unchecked, 8.1s Time] [2022-11-18 20:46:25,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-11-18 20:46:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 281. [2022-11-18 20:46:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 234 states have (on average 1.4658119658119657) internal successors, (343), 280 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-18 20:46:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 343 transitions. [2022-11-18 20:46:25,177 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 343 transitions. Word has length 32 [2022-11-18 20:46:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:25,177 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 343 transitions. [2022-11-18 20:46:25,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:46:25,177 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 343 transitions. [2022-11-18 20:46:25,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:46:25,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:25,178 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-18 20:46:25,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:46:25,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:46:25,389 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-18 20:46:25,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1040719993, now seen corresponding path program 1 times [2022-11-18 20:46:25,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:46:25,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845955638] [2022-11-18 20:46:25,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:25,390 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-18 20:46:25,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:46:25,391 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:46:25,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-18 20:46:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:25,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 20:46:25,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:46:25,589 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-18 20:46:25,738 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-18 20:46:25,765 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:46:25,765 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-18 20:46:25,808 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-18 20:46:25,826 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-18 20:46:25,994 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:46:25,995 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-18 20:46:26,008 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-18 20:46:26,154 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:46:26,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 46 treesize of output 45 [2022-11-18 20:46:26,166 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-18 20:46:26,393 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-18 20:46:26,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 20:46:26,469 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-18 20:46:26,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:46:27,071 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (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_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))) (forall ((v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2022-11-18 20:46:27,119 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_583 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) is different from false [2022-11-18 20:46:27,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_580))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_581) .cse3 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))))) is different from false [2022-11-18 20:46:27,289 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_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_581) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_580) |c_ULTIMATE.start_main_~n~0#1.base|) .cse2) v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_581 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_580))) (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_581) .cse4 v_ArrVal_583) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_582) |c_ULTIMATE.start_main_~root~0#1.base|) .cse3))))))))) is different from false [2022-11-18 20:46:27,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:46:27,341 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-18 20:46:27,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:46:27,357 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-18 20:46:27,364 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-18 20:46:27,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:46:27,404 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-18 20:46:27,415 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 180 [2022-11-18 20:46:27,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 138 [2022-11-18 20:46:27,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2022-11-18 20:46:27,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:46:27,678 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-18 20:46:27,697 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:46:27,697 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-18 20:46:27,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:46:27,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:46:27,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:46:27,711 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-18 20:46:27,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:46:27,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:46:27,722 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-18 20:46:27,740 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:46:28,147 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-18 20:46:28,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:46:28,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845955638] [2022-11-18 20:46:28,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845955638] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:46:28,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:46:28,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-11-18 20:46:28,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50930169] [2022-11-18 20:46:28,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:46:28,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:46:28,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:46:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:46:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=290, Unknown=4, NotChecked=148, Total=506 [2022-11-18 20:46:28,149 INFO L87 Difference]: Start difference. First operand 281 states and 343 transitions. Second operand has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:46:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:46:41,735 INFO L93 Difference]: Finished difference Result 473 states and 563 transitions. [2022-11-18 20:46:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:46:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 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-18 20:46:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:46:41,739 INFO L225 Difference]: With dead ends: 473 [2022-11-18 20:46:41,739 INFO L226 Difference]: Without dead ends: 473 [2022-11-18 20:46:41,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=230, Invalid=774, Unknown=4, NotChecked=252, Total=1260 [2022-11-18 20:46:41,741 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 684 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 968 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:46:41,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 847 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1436 Invalid, 0 Unknown, 968 Unchecked, 8.8s Time] [2022-11-18 20:46:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-11-18 20:46:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 357. [2022-11-18 20:46:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 315 states have (on average 1.4) internal successors, (441), 356 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:46:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 441 transitions. [2022-11-18 20:46:41,752 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 441 transitions. Word has length 32 [2022-11-18 20:46:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:46:41,753 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 441 transitions. [2022-11-18 20:46:41,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8636363636363638) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:46:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 441 transitions. [2022-11-18 20:46:41,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:46:41,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:46:41,754 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-18 20:46:41,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-11-18 20:46:41,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:46:41,966 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-18 20:46:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:46:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1040904692, now seen corresponding path program 1 times [2022-11-18 20:46:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:46:41,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295935175] [2022-11-18 20:46:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:46:41,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-18 20:46:41,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:46:41,968 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:46:41,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Waiting until timeout for monitored process [2022-11-18 20:46:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:46:42,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-18 20:46:42,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:46:42,171 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-18 20:46:42,216 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-18 20:46:42,226 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-18 20:46:43,132 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:46:43,132 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-18 20:46:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:46:43,290 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-18 20:46:43,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:46:43,317 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-18 20:46:43,793 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:46:43,793 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-18 20:46:43,811 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-18 20:46:44,167 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:46:44,168 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-18 20:46:44,180 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-18 20:46:44,495 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-18 20:46:44,512 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-18 20:46:44,716 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-18 20:46:44,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:46:45,048 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_627) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-18 20:46:45,463 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_626) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_628) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_625))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_627)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-18 20:46:45,519 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_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_626) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_628) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_625))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_627)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-18 20:46:45,633 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_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_625))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_627)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_622 (_ BitVec 32)) (v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (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_622)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_626) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_628) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-18 20:46:45,752 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_13|))) (forall ((v_ArrVal_622 (_ BitVec 32)) (v_ArrVal_626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (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|) .cse0 v_ArrVal_622)) |v_ULTIMATE.start_main_#t~malloc18#1.base_13| v_ArrVal_626) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc18#1.base_13|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_13| v_ArrVal_625) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_628) |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_13| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_13|))) (forall ((v_ArrVal_627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_625 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc18#1.base_13|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_13| v_ArrVal_625))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_627)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))))) is different from false [2022-11-18 20:46:54,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:46:54,419 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 47 [2022-11-18 20:46:54,447 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 106 treesize of output 88 [2022-11-18 20:46:54,461 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 104 treesize of output 72 [2022-11-18 20:46:54,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 9 treesize of output 7 [2022-11-18 20:46:54,546 INFO L321 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-11-18 20:46:54,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2022-11-18 20:46:54,571 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-18 20:46:54,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:46:54,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295935175] [2022-11-18 20:46:54,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295935175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:46:54,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:46:54,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 27 [2022-11-18 20:46:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113511300] [2022-11-18 20:46:54,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:46:54,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-18 20:46:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:46:54,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-18 20:46:54,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=375, Unknown=17, NotChecked=220, Total=702 [2022-11-18 20:46:54,573 INFO L87 Difference]: Start difference. First operand 357 states and 441 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:07,044 INFO L93 Difference]: Finished difference Result 489 states and 597 transitions. [2022-11-18 20:47:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:47:07,045 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 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-18 20:47:07,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:07,046 INFO L225 Difference]: With dead ends: 489 [2022-11-18 20:47:07,046 INFO L226 Difference]: Without dead ends: 489 [2022-11-18 20:47:07,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=274, Invalid=850, Unknown=18, NotChecked=340, Total=1482 [2022-11-18 20:47:07,048 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 261 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 2145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1309 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:07,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1232 Invalid, 2145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 806 Invalid, 0 Unknown, 1309 Unchecked, 4.5s Time] [2022-11-18 20:47:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-11-18 20:47:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 409. [2022-11-18 20:47:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 367 states have (on average 1.3923705722070845) internal successors, (511), 408 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 511 transitions. [2022-11-18 20:47:07,060 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 511 transitions. Word has length 32 [2022-11-18 20:47:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:07,060 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 511 transitions. [2022-11-18 20:47:07,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 511 transitions. [2022-11-18 20:47:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:47:07,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:07,062 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-18 20:47:07,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-18 20:47:07,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:07,277 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:47:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash 892950918, now seen corresponding path program 1 times [2022-11-18 20:47:07,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:47:07,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720166580] [2022-11-18 20:47:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:07,278 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-18 20:47:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:47:07,279 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:07,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:07,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:47:07,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:47:07,530 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-18 20:47:07,644 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-18 20:47:07,688 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-18 20:47:08,304 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:47:08,304 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-18 20:47:08,512 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-18 20:47:08,546 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-18 20:47:09,018 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:09,018 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-18 20:47:09,053 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-18 20:47:09,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:09,402 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-18 20:47:09,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:47:09,935 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-18 20:47:09,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:09,946 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-18 20:47:10,148 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-18 20:47:10,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:47:10,579 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_675) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))))) is different from false [2022-11-18 20:47:10,619 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_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_675) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))) (forall ((v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))) is different from false [2022-11-18 20:47:10,690 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_672) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_673))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv0 32))))) is different from false [2022-11-18 20:47:10,740 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_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_672) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_673) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_673))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))) is different from false [2022-11-18 20:47:10,855 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_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_669 (_ BitVec 32)) (v_ArrVal_672 (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_669)) |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_672) (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_673) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_674) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))) (forall ((v_ArrVal_673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_675 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_#t~malloc13#1.base| v_ArrVal_673))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_675)) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) (_ bv0 32))))) is different from false [2022-11-18 20:47:12,558 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:12,558 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-18 20:47:12,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:12,580 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 242 treesize of output 164 [2022-11-18 20:47:12,597 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 133 treesize of output 117 [2022-11-18 20:47:12,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:12,618 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 117 treesize of output 97 [2022-11-18 20:47:12,689 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-18 20:47:12,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2022-11-18 20:47:12,848 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-18 20:47:12,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:47:12,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720166580] [2022-11-18 20:47:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720166580] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:47:12,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:47:12,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2022-11-18 20:47:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661979708] [2022-11-18 20:47:12,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:47:12,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:47:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:47:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:47:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=245, Unknown=11, NotChecked=180, Total=506 [2022-11-18 20:47:12,851 INFO L87 Difference]: Start difference. First operand 409 states and 511 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:20,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:20,695 INFO L93 Difference]: Finished difference Result 762 states and 947 transitions. [2022-11-18 20:47:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:47:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 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-18 20:47:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:20,699 INFO L225 Difference]: With dead ends: 762 [2022-11-18 20:47:20,699 INFO L226 Difference]: Without dead ends: 762 [2022-11-18 20:47:20,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=273, Invalid=728, Unknown=11, NotChecked=320, Total=1332 [2022-11-18 20:47:20,701 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 303 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1308 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:20,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1209 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 887 Invalid, 0 Unknown, 1308 Unchecked, 4.8s Time] [2022-11-18 20:47:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-11-18 20:47:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 437. [2022-11-18 20:47:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 395 states have (on average 1.3822784810126583) internal successors, (546), 436 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 546 transitions. [2022-11-18 20:47:20,714 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 546 transitions. Word has length 32 [2022-11-18 20:47:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:20,714 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 546 transitions. [2022-11-18 20:47:20,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 546 transitions. [2022-11-18 20:47:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:47:20,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:20,715 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-18 20:47:20,729 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:20,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:20,929 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-18 20:47:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2089686132, now seen corresponding path program 1 times [2022-11-18 20:47:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:47:20,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202499517] [2022-11-18 20:47:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:20,930 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-18 20:47:20,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:47:20,931 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:20,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-18 20:47:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:21,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-18 20:47:21,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:47:21,154 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-18 20:47:21,193 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-18 20:47:21,202 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-18 20:47:22,067 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:47:22,068 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-18 20:47:22,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:22,218 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-18 20:47:22,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:47:22,264 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-18 20:47:22,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:22,811 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-18 20:47:22,827 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-18 20:47:23,182 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:23,183 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-18 20:47:23,213 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-18 20:47:23,565 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-18 20:47:23,576 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-18 20:47:24,001 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-18 20:47:24,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:47:24,459 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem20#1.base| v_ArrVal_733) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-18 20:47:24,507 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_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_733) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-18 20:47:24,588 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_732))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_733)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_731) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem19#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-18 20:47:24,640 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_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_731) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_732))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_733)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2022-11-18 20:47:24,757 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_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_732))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_733)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (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|) .cse1 v_ArrVal_730)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_731) (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_734) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2022-11-18 20:47:24,875 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc18#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_17|))) (forall ((v_ArrVal_731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_730 (_ BitVec 32)) (v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_734 (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|) .cse0 v_ArrVal_730)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_731) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_734) |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_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_17|))) (forall ((v_ArrVal_732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_733 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc18#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_17| v_ArrVal_732))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_733)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))))) is different from false [2022-11-18 20:47:30,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:30,898 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 47 [2022-11-18 20:47:30,919 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 164 [2022-11-18 20:47:30,934 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 133 treesize of output 105 [2022-11-18 20:47:30,946 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 105 treesize of output 97 [2022-11-18 20:47:31,005 INFO L321 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-11-18 20:47:31,006 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-18 20:47:31,025 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-18 20:47:31,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:47:31,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202499517] [2022-11-18 20:47:31,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202499517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:47:31,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:47:31,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 28 [2022-11-18 20:47:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837849322] [2022-11-18 20:47:31,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:47:31,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-18 20:47:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:47:31,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-18 20:47:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=384, Unknown=12, NotChecked=270, Total=756 [2022-11-18 20:47:31,028 INFO L87 Difference]: Start difference. First operand 437 states and 546 transitions. Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:39,045 INFO L93 Difference]: Finished difference Result 487 states and 600 transitions. [2022-11-18 20:47:39,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:47:39,046 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 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-18 20:47:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:39,048 INFO L225 Difference]: With dead ends: 487 [2022-11-18 20:47:39,048 INFO L226 Difference]: Without dead ends: 487 [2022-11-18 20:47:39,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=202, Invalid=931, Unknown=13, NotChecked=414, Total=1560 [2022-11-18 20:47:39,050 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 166 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1198 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:39,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1140 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 514 Invalid, 0 Unknown, 1198 Unchecked, 3.1s Time] [2022-11-18 20:47:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-11-18 20:47:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 455. [2022-11-18 20:47:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 413 states have (on average 1.3728813559322033) internal successors, (567), 454 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 567 transitions. [2022-11-18 20:47:39,062 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 567 transitions. Word has length 34 [2022-11-18 20:47:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:39,062 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 567 transitions. [2022-11-18 20:47:39,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 567 transitions. [2022-11-18 20:47:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:47:39,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:39,064 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-18 20:47:39,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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)] Ended with exit code 0 [2022-11-18 20:47:39,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:39,280 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:47:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash 742188428, now seen corresponding path program 1 times [2022-11-18 20:47:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:47:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315803746] [2022-11-18 20:47:39,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:39,281 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-18 20:47:39,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:47:39,282 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:39,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-18 20:47:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:39,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 20:47:39,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:47:39,492 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-18 20:47:39,861 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:47:39,862 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-18 20:47:40,025 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-18 20:47:40,057 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-18 20:47:40,517 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:40,517 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-18 20:47:40,540 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-18 20:47:40,826 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:40,827 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-18 20:47:40,839 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-18 20:47:41,271 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-11-18 20:47:41,272 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-18 20:47:41,555 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-18 20:47:41,567 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-18 20:47:42,750 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-18 20:47:42,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:47:44,224 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_793 (_ BitVec 1))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_791) |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_16| v_ArrVal_793) .cse0) (_ bv1 1))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|)))) (forall ((v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_792) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-18 20:47:44,289 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_792 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_792) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_793 (_ BitVec 1))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_791) |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_16| v_ArrVal_793) .cse1) (_ bv1 1))) (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|)))))) is different from false [2022-11-18 20:47:44,406 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_790) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_789) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_792) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_793 (_ BitVec 1)) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_789))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_791)) |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_16|) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_16| v_ArrVal_793) .cse0) (_ bv1 1))))))) is different from false [2022-11-18 20:47:44,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (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_791 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_16| (_ BitVec 32)) (v_ArrVal_793 (_ BitVec 1)) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_789))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_791)) |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_16| v_ArrVal_793) .cse0) (_ bv1 1))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_16|)))) (forall ((v_ArrVal_790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_789 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_790) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_789) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_792) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-18 20:47:44,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:44,542 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-18 20:47:44,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:44,565 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-18 20:47:44,577 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-18 20:47:44,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:44,628 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 166 treesize of output 161 [2022-11-18 20:47:44,642 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 146 treesize of output 136 [2022-11-18 20:47:44,657 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 114 treesize of output 110 [2022-11-18 20:47:44,671 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 110 treesize of output 98 [2022-11-18 20:47:44,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:44,861 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-18 20:47:44,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:47:44,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:47:44,879 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-18 20:47:44,896 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-18 20:47:45,994 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-18 20:47:45,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:47:45,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315803746] [2022-11-18 20:47:45,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315803746] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:47:45,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:47:45,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2022-11-18 20:47:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141856781] [2022-11-18 20:47:45,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:47:45,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:47:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:47:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:47:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=345, Unknown=4, NotChecked=164, Total=600 [2022-11-18 20:47:45,997 INFO L87 Difference]: Start difference. First operand 455 states and 567 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:47:53,560 INFO L93 Difference]: Finished difference Result 820 states and 1035 transitions. [2022-11-18 20:47:53,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:47:53,561 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 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-18 20:47:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:47:53,564 INFO L225 Difference]: With dead ends: 820 [2022-11-18 20:47:53,564 INFO L226 Difference]: Without dead ends: 820 [2022-11-18 20:47:53,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=230, Invalid=838, Unknown=4, NotChecked=260, Total=1332 [2022-11-18 20:47:53,566 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 384 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1122 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:47:53,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 621 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 692 Invalid, 0 Unknown, 1122 Unchecked, 3.9s Time] [2022-11-18 20:47:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-18 20:47:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 698. [2022-11-18 20:47:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 656 states have (on average 1.3841463414634145) internal successors, (908), 697 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 908 transitions. [2022-11-18 20:47:53,585 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 908 transitions. Word has length 34 [2022-11-18 20:47:53,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:47:53,586 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 908 transitions. [2022-11-18 20:47:53,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:47:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 908 transitions. [2022-11-18 20:47:53,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:47:53,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:47:53,587 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-18 20:47:53,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-18 20:47:53,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:53,802 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:47:53,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:47:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 742188429, now seen corresponding path program 1 times [2022-11-18 20:47:53,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:47:53,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589592004] [2022-11-18 20:47:53,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:47:53,803 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-18 20:47:53,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:47:53,805 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:53,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:47:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:47:54,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 20:47:54,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:47:54,095 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-18 20:47:54,383 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-18 20:47:54,384 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-18 20:47:54,404 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-18 20:47:54,533 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-18 20:47:54,574 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-18 20:47:54,956 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:54,957 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-18 20:47:54,988 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-18 20:47:55,258 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:47:55,258 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-18 20:47:55,288 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-18 20:47:55,581 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:47:55,581 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-18 20:47:55,814 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-18 20:47:55,826 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-18 20:47:56,667 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-18 20:47:56,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:47:59,502 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_850) |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_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((v_ArrVal_852 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_850) |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_18| v_ArrVal_852) .cse0))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|))))) is different from false [2022-11-18 20:47:59,574 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_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_851) |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_18|) (forall ((v_ArrVal_852 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_850) |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_18| v_ArrVal_852) .cse0)))))) (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-18 20:47:59,706 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_849))) (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_851) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((v_ArrVal_852 (_ BitVec 32))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_848) .cse0 v_ArrVal_850) |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_18| v_ArrVal_852) .cse1))) (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|)))))) (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_848) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_849) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-18 20:47:59,802 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_18| (_ BitVec 32)) (v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_849))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse0 (select (select (store .cse3 .cse2 v_ArrVal_851) |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_18|) (forall ((v_ArrVal_852 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_848) .cse2 v_ArrVal_850) |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_18| v_ArrVal_852) .cse0)))))))) (forall ((v_ArrVal_850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_848) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_849) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_850) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-18 20:47:59,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:59,885 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-18 20:47:59,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:59,908 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-18 20:47:59,919 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-18 20:47:59,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:47:59,970 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-18 20:47:59,985 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-18 20:47:59,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2022-11-18 20:48:00,011 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-18 20:48:00,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:48:00,225 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-18 20:48:00,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:48:00,259 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-18 20:48:00,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:48:00,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:48:00,276 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-18 20:48:00,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:48:00,297 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-18 20:48:00,316 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-18 20:48:02,605 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-18 20:48:02,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:48:02,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589592004] [2022-11-18 20:48:02,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589592004] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:48:02,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:48:02,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2022-11-18 20:48:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016667497] [2022-11-18 20:48:02,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:48:02,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:48:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:48:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:48:02,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=404, Unknown=4, NotChecked=172, Total=650 [2022-11-18 20:48:02,608 INFO L87 Difference]: Start difference. First operand 698 states and 908 transitions. Second operand has 26 states, 25 states have (on average 2.56) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:18,752 INFO L93 Difference]: Finished difference Result 1008 states and 1281 transitions. [2022-11-18 20:48:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 20:48:18,754 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 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-18 20:48:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:18,757 INFO L225 Difference]: With dead ends: 1008 [2022-11-18 20:48:18,757 INFO L226 Difference]: Without dead ends: 1008 [2022-11-18 20:48:18,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=203, Invalid=998, Unknown=5, NotChecked=276, Total=1482 [2022-11-18 20:48:18,758 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 492 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1175 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:18,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 890 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1151 Invalid, 0 Unknown, 1175 Unchecked, 9.0s Time] [2022-11-18 20:48:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-11-18 20:48:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 809. [2022-11-18 20:48:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 767 states have (on average 1.3663624511082137) internal successors, (1048), 808 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1048 transitions. [2022-11-18 20:48:18,779 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1048 transitions. Word has length 34 [2022-11-18 20:48:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:18,780 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1048 transitions. [2022-11-18 20:48:18,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.56) internal successors, (64), 26 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1048 transitions. [2022-11-18 20:48:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 20:48:18,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:18,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:48:18,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-18 20:48:18,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:18,996 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:48:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1533003794, now seen corresponding path program 1 times [2022-11-18 20:48:18,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:48:18,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805907297] [2022-11-18 20:48:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:18,998 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-18 20:48:18,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:48:18,999 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:19,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-11-18 20:48:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:19,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 20:48:19,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:48:19,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:48:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:48:20,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:48:20,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805907297] [2022-11-18 20:48:20,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805907297] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:48:20,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:48:20,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2022-11-18 20:48:20,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362019118] [2022-11-18 20:48:20,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:48:20,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:48:20,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:48:20,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:48:20,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:48:20,216 INFO L87 Difference]: Start difference. First operand 809 states and 1048 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:21,450 INFO L93 Difference]: Finished difference Result 864 states and 1117 transitions. [2022-11-18 20:48:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:48:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-18 20:48:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:21,453 INFO L225 Difference]: With dead ends: 864 [2022-11-18 20:48:21,453 INFO L226 Difference]: Without dead ends: 864 [2022-11-18 20:48:21,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:48:21,454 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 235 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:21,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 338 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 20:48:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-11-18 20:48:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 812. [2022-11-18 20:48:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 770 states have (on average 1.3675324675324676) internal successors, (1053), 811 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1053 transitions. [2022-11-18 20:48:21,481 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1053 transitions. Word has length 35 [2022-11-18 20:48:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:21,482 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1053 transitions. [2022-11-18 20:48:21,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1053 transitions. [2022-11-18 20:48:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 20:48:21,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:21,483 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:48:21,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-11-18 20:48:21,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:21,696 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:48:21,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:21,697 INFO L85 PathProgramCache]: Analyzing trace with hash -396121760, now seen corresponding path program 2 times [2022-11-18 20:48:21,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:48:21,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894965214] [2022-11-18 20:48:21,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:48:21,697 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-18 20:48:21,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:48:21,698 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:21,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-18 20:48:21,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:48:21,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:48:21,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:48:21,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:21,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-18 20:48:21,982 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-18 20:48:22,217 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 31 treesize of output 24 [2022-11-18 20:48:22,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:48:22,361 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 40 treesize of output 27 [2022-11-18 20:48:22,529 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-18 20:48:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:48:22,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:48:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:48:23,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:48:23,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894965214] [2022-11-18 20:48:23,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894965214] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:48:23,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:48:23,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-11-18 20:48:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117134854] [2022-11-18 20:48:23,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:48:23,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:48:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:48:23,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:48:23,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:48:23,205 INFO L87 Difference]: Start difference. First operand 812 states and 1053 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:31,403 INFO L93 Difference]: Finished difference Result 955 states and 1210 transitions. [2022-11-18 20:48:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:48:31,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-18 20:48:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:31,414 INFO L225 Difference]: With dead ends: 955 [2022-11-18 20:48:31,414 INFO L226 Difference]: Without dead ends: 955 [2022-11-18 20:48:31,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2022-11-18 20:48:31,415 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 244 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:31,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 679 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-11-18 20:48:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-11-18 20:48:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 857. [2022-11-18 20:48:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 815 states have (on average 1.361963190184049) internal successors, (1110), 856 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1110 transitions. [2022-11-18 20:48:31,436 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1110 transitions. Word has length 35 [2022-11-18 20:48:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:31,436 INFO L495 AbstractCegarLoop]: Abstraction has 857 states and 1110 transitions. [2022-11-18 20:48:31,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1110 transitions. [2022-11-18 20:48:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-18 20:48:31,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:31,438 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:48:31,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-18 20:48:31,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:31,652 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:48:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash -396121759, now seen corresponding path program 1 times [2022-11-18 20:48:31,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:48:31,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097063478] [2022-11-18 20:48:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:31,653 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-18 20:48:31,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:48:31,654 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:31,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:31,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-18 20:48:31,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:32,148 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-18 20:48:32,172 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-18 20:48:32,684 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-18 20:48:32,718 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-18 20:48:32,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:48:32,949 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-18 20:48:32,980 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 30 treesize of output 23 [2022-11-18 20:48:33,291 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-18 20:48:33,302 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-18 20:48:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:48:33,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:48:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:48:35,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:48:35,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097063478] [2022-11-18 20:48:35,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097063478] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:48:35,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:48:35,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2022-11-18 20:48:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499137031] [2022-11-18 20:48:35,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:48:35,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:48:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:48:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:48:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:48:35,766 INFO L87 Difference]: Start difference. First operand 857 states and 1110 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:43,790 INFO L93 Difference]: Finished difference Result 940 states and 1198 transitions. [2022-11-18 20:48:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:48:43,792 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-18 20:48:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:43,795 INFO L225 Difference]: With dead ends: 940 [2022-11-18 20:48:43,795 INFO L226 Difference]: Without dead ends: 940 [2022-11-18 20:48:43,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2022-11-18 20:48:43,796 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 122 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:43,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2266 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-18 20:48:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-11-18 20:48:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 858. [2022-11-18 20:48:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 816 states have (on average 1.3615196078431373) internal successors, (1111), 857 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1111 transitions. [2022-11-18 20:48:43,812 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1111 transitions. Word has length 35 [2022-11-18 20:48:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:43,812 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1111 transitions. [2022-11-18 20:48:43,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1111 transitions. [2022-11-18 20:48:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:48:43,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:43,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:48:43,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-18 20:48:44,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:44,026 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:48:44,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash 278482478, now seen corresponding path program 1 times [2022-11-18 20:48:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:48:44,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689068289] [2022-11-18 20:48:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:44,027 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-18 20:48:44,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:48:44,028 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:44,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-11-18 20:48:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:44,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:48:44,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:44,236 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-18 20:48:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:48:44,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:48:44,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:48:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689068289] [2022-11-18 20:48:44,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1689068289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:48:44,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:48:44,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:48:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113851560] [2022-11-18 20:48:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:48:44,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:48:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:48:44,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:48:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:48:44,269 INFO L87 Difference]: Start difference. First operand 858 states and 1111 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:44,744 INFO L93 Difference]: Finished difference Result 860 states and 1114 transitions. [2022-11-18 20:48:44,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:48:44,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 20:48:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:44,747 INFO L225 Difference]: With dead ends: 860 [2022-11-18 20:48:44,747 INFO L226 Difference]: Without dead ends: 860 [2022-11-18 20:48:44,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-18 20:48:44,748 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:44,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 178 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:48:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-11-18 20:48:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 858. [2022-11-18 20:48:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 818 states have (on average 1.3606356968215159) internal successors, (1113), 857 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1113 transitions. [2022-11-18 20:48:44,763 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1113 transitions. Word has length 36 [2022-11-18 20:48:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:44,763 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1113 transitions. [2022-11-18 20:48:44,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1113 transitions. [2022-11-18 20:48:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:48:44,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:44,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:48:44,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-11-18 20:48:44,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:44,977 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:48:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 278482479, now seen corresponding path program 1 times [2022-11-18 20:48:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:48:44,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466842737] [2022-11-18 20:48:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:44,978 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-18 20:48:44,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:48:44,978 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:44,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-18 20:48:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:45,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:48:45,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:45,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:48:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:48:45,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:48:45,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:48:45,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466842737] [2022-11-18 20:48:45,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466842737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:48:45,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:48:45,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:48:45,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699973441] [2022-11-18 20:48:45,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:48:45,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:48:45,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:48:45,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:48:45,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:48:45,211 INFO L87 Difference]: Start difference. First operand 858 states and 1113 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:48:45,753 INFO L93 Difference]: Finished difference Result 860 states and 1113 transitions. [2022-11-18 20:48:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:48:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-18 20:48:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:48:45,755 INFO L225 Difference]: With dead ends: 860 [2022-11-18 20:48:45,755 INFO L226 Difference]: Without dead ends: 860 [2022-11-18 20:48:45,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-18 20:48:45,755 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:48:45,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 173 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:48:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-11-18 20:48:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 856. [2022-11-18 20:48:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 818 states have (on average 1.3569682151589242) internal successors, (1110), 855 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1110 transitions. [2022-11-18 20:48:45,768 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1110 transitions. Word has length 36 [2022-11-18 20:48:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:48:45,768 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 1110 transitions. [2022-11-18 20:48:45,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:48:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1110 transitions. [2022-11-18 20:48:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:48:45,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:48:45,770 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:48:45,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-11-18 20:48:45,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:45,982 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-18 20:48:45,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:48:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash 99445590, now seen corresponding path program 1 times [2022-11-18 20:48:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:48:45,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978875917] [2022-11-18 20:48:45,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:48:45,983 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-18 20:48:45,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:48:45,983 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:45,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cfd9e7-b54d-4d56-9320-19b8caa20be9/bin/uautomizer-TMbwUNV5ro/mathsat -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-18 20:48:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:48:46,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:48:46,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:48:46,220 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-18 20:48:46,612 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:48:46,612 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-18 20:48:46,782 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-18 20:48:47,216 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:48:47,217 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 30 treesize of output 31 [2022-11-18 20:48:47,554 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:48:47,554 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 30 treesize of output 31 [2022-11-18 20:48:47,955 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-18 20:48:47,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 30 treesize of output 51 [2022-11-18 20:48:48,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:48:48,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-11-18 20:48:48,902 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:48:48,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2022-11-18 20:48:49,373 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:48:49,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2022-11-18 20:48:50,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:48:50,189 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 51 treesize of output 23 [2022-11-18 20:48:50,433 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-18 20:48:50,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:48:53,072 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (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))) v_ArrVal_1190) |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-18 20:48:53,125 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (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_1189))) (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_1190)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-18 20:48:53,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (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_1189))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1190))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-18 20:48:53,244 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (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|)) |c_ULTIMATE.start_main_#t~malloc18#1.base| v_ArrVal_1189))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1190))) |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-18 20:48:53,314 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1189 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc18#1.base_22| (_ BitVec 32)) (v_ArrVal_1186 (_ BitVec 1)) (v_ArrVal_1190 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_22| v_ArrVal_1186) (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (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 |v_ULTIMATE.start_main_#t~malloc18#1.base_22|)) |v_ULTIMATE.start_main_#t~malloc18#1.base_22| v_ArrVal_1189))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1190))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_22|))))) is different from false [2022-11-18 20:48:57,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:48:57,527 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 165 treesize of output 110 [2022-11-18 20:48:57,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:48:57,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:48:57,777 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 195062 treesize of output 193492 [2022-11-18 20:48:58,785 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 193478 treesize of output 186310 [2022-11-18 20:48:59,879 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 186310 treesize of output 182726 [2022-11-18 20:49:01,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:49:01,023 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 188102 treesize of output 186306 [2022-11-18 20:49:02,088 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 189882 treesize of output 188474