./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8 --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 b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 --- 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-e04fb08 [2022-11-16 12:16:21,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:16:21,201 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:16:21,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:16:21,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:16:21,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:16:21,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:16:21,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:16:21,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:16:21,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:16:21,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:16:21,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:16:21,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:16:21,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:16:21,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:16:21,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:16:21,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:16:21,268 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:16:21,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:16:21,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:16:21,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:16:21,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:16:21,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:16:21,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:16:21,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:16:21,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:16:21,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:16:21,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:16:21,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:16:21,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:16:21,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:16:21,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:16:21,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:16:21,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:16:21,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:16:21,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:16:21,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:16:21,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:16:21,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:16:21,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:16:21,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:16:21,311 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:16:21,354 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:16:21,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:16:21,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:16:21,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:16:21,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:16:21,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:16:21,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:16:21,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:16:21,359 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:16:21,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:16:21,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:16:21,360 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:16:21,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:16:21,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:16:21,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:16:21,361 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:16:21,362 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:16:21,362 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:16:21,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:16:21,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:16:21,362 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:16:21,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:16:21,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:16:21,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:16:21,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:16:21,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:16:21,364 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:16:21,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:16:21,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:16:21,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:16:21,365 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_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/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_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8 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 -> b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 [2022-11-16 12:16:21,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:16:21,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:16:21,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:16:21,710 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:16:21,711 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:16:21,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2022-11-16 12:16:21,793 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/1fbd59a44/c832f78dc1f04f02810e6e8ab2926734/FLAG4fe632bbb [2022-11-16 12:16:22,407 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:16:22,410 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2022-11-16 12:16:22,424 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/1fbd59a44/c832f78dc1f04f02810e6e8ab2926734/FLAG4fe632bbb [2022-11-16 12:16:22,621 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/1fbd59a44/c832f78dc1f04f02810e6e8ab2926734 [2022-11-16 12:16:22,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:16:22,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:16:22,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:16:22,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:16:22,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:16:22,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:22" (1/1) ... [2022-11-16 12:16:22,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642b089f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:22, skipping insertion in model container [2022-11-16 12:16:22,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:22" (1/1) ... [2022-11-16 12:16:22,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:16:22,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:16:23,175 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[33021,33034] [2022-11-16 12:16:23,303 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[45234,45247] [2022-11-16 12:16:23,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:16:23,319 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-16 12:16:23,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4abf2e6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:23, skipping insertion in model container [2022-11-16 12:16:23,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:16:23,323 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-11-16 12:16:23,325 INFO L158 Benchmark]: Toolchain (without parser) took 698.58ms. Allocated memory is still 121.6MB. Free memory was 84.8MB in the beginning and 86.5MB in the end (delta: -1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:16:23,332 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 94.2MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:16:23,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.78ms. Allocated memory is still 121.6MB. Free memory was 84.4MB in the beginning and 86.5MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:16:23,335 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.33ms. Allocated memory is still 121.6MB. Free memory was 94.2MB in the beginning and 94.2MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.78ms. Allocated memory is still 121.6MB. Free memory was 84.4MB in the beginning and 86.5MB in the end (delta: -2.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8 --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 b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 --- 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-e04fb08 [2022-11-16 12:16:25,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:16:25,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:16:25,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:16:25,474 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:16:25,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:16:25,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:16:25,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:16:25,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:16:25,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:16:25,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:16:25,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:16:25,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:16:25,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:16:25,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:16:25,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:16:25,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:16:25,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:16:25,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:16:25,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:16:25,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:16:25,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:16:25,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:16:25,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:16:25,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:16:25,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:16:25,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:16:25,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:16:25,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:16:25,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:16:25,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:16:25,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:16:25,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:16:25,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:16:25,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:16:25,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:16:25,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:16:25,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:16:25,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:16:25,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:16:25,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:16:25,523 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 12:16:25,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:16:25,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:16:25,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:16:25,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:16:25,559 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:16:25,559 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:16:25,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:16:25,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:16:25,560 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:16:25,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:16:25,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:16:25,561 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:16:25,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:16:25,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:16:25,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:16:25,561 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:16:25,562 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:16:25,562 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:16:25,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:16:25,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:16:25,562 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:16:25,562 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:16:25,563 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:16:25,563 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:16:25,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:16:25,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:16:25,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:16:25,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:16:25,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:16:25,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:16:25,564 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:16:25,564 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:16:25,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:16:25,565 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_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/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_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8 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 -> b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 [2022-11-16 12:16:25,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:16:25,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:16:25,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:16:25,947 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:16:25,950 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:16:25,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2022-11-16 12:16:26,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/2fcbdf21b/d5b7b9df627044d7aca458e616ba9bab/FLAG468c0d91e [2022-11-16 12:16:26,743 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:16:26,743 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2022-11-16 12:16:26,759 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/2fcbdf21b/d5b7b9df627044d7aca458e616ba9bab/FLAG468c0d91e [2022-11-16 12:16:26,999 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/data/2fcbdf21b/d5b7b9df627044d7aca458e616ba9bab [2022-11-16 12:16:27,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:16:27,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:16:27,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:16:27,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:16:27,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:16:27,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:27,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c98e3e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27, skipping insertion in model container [2022-11-16 12:16:27,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:27,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:16:27,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:16:27,546 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[33021,33034] [2022-11-16 12:16:27,746 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[45234,45247] [2022-11-16 12:16:27,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:16:27,764 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 12:16:27,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:16:27,794 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[33021,33034] [2022-11-16 12:16:27,844 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[45234,45247] [2022-11-16 12:16:27,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:16:27,862 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:16:27,888 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[33021,33034] [2022-11-16 12:16:27,930 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[45234,45247] [2022-11-16 12:16:27,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:16:27,973 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:16:27,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27 WrapperNode [2022-11-16 12:16:27,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:16:27,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:16:27,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:16:27,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:16:27,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,129 INFO L138 Inliner]: procedures = 180, calls = 297, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1007 [2022-11-16 12:16:28,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:16:28,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:16:28,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:16:28,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:16:28,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,233 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:16:28,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:16:28,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:16:28,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:16:28,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (1/1) ... [2022-11-16 12:16:28,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:16:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:16:28,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:16:28,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:16:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 12:16:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:16:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-16 12:16:28,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-16 12:16:28,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 12:16:28,346 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 12:16:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-11-16 12:16:28,346 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-11-16 12:16:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:16:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:16:28,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:16:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:16:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-16 12:16:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:16:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:16:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:16:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:16:28,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:16:28,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:16:28,610 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:16:28,612 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:16:28,617 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 12:16:34,184 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:16:34,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:16:34,212 INFO L300 CfgBuilder]: Removed 62 assume(true) statements. [2022-11-16 12:16:34,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:34 BoogieIcfgContainer [2022-11-16 12:16:34,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:16:34,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:16:34,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:16:34,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:16:34,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:16:27" (1/3) ... [2022-11-16 12:16:34,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a236edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:16:34, skipping insertion in model container [2022-11-16 12:16:34,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:16:27" (2/3) ... [2022-11-16 12:16:34,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a236edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:16:34, skipping insertion in model container [2022-11-16 12:16:34,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:16:34" (3/3) ... [2022-11-16 12:16:34,230 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-1.i [2022-11-16 12:16:34,249 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:16:34,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-11-16 12:16:34,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:16:34,319 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;@2b9b3eec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:16:34,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-11-16 12:16:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 1096 states, 539 states have (on average 2.241187384044527) internal successors, (1208), 1087 states have internal predecessors, (1208), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-11-16 12:16:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:16:34,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:34,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:16:34,334 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:34,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:34,338 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-11-16 12:16:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:34,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634413273] [2022-11-16 12:16:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:34,352 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-16 12:16:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:34,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:34,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:34,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:16:34,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:34,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 7 [2022-11-16 12:16:34,684 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-16 12:16:34,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:34,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:34,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634413273] [2022-11-16 12:16:34,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634413273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:34,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:34,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:16:34,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972380116] [2022-11-16 12:16:34,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:34,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:16:34,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:34,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:16:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:16:34,738 INFO L87 Difference]: Start difference. First operand has 1096 states, 539 states have (on average 2.241187384044527) internal successors, (1208), 1087 states have internal predecessors, (1208), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) 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-16 12:16:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:37,159 INFO L93 Difference]: Finished difference Result 1099 states and 1184 transitions. [2022-11-16 12:16:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:16:37,162 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-16 12:16:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:37,181 INFO L225 Difference]: With dead ends: 1099 [2022-11-16 12:16:37,181 INFO L226 Difference]: Without dead ends: 1097 [2022-11-16 12:16:37,183 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-16 12:16:37,187 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 969 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:37,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 823 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-16 12:16:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-11-16 12:16:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1085. [2022-11-16 12:16:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 542 states have (on average 2.0904059040590406) internal successors, (1133), 1075 states have internal predecessors, (1133), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-16 12:16:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1175 transitions. [2022-11-16 12:16:37,286 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1175 transitions. Word has length 3 [2022-11-16 12:16:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:37,287 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1175 transitions. [2022-11-16 12:16:37,287 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-16 12:16:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1175 transitions. [2022-11-16 12:16:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:16:37,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:37,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:16:37,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:16:37,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:37,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:37,501 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-11-16 12:16:37,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:37,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362790295] [2022-11-16 12:16:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:37,503 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-16 12:16:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:37,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:37,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:37,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:16:37,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:37,667 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-16 12:16:37,684 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-16 12:16:37,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:37,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:37,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362790295] [2022-11-16 12:16:37,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362790295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:37,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:37,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:16:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885983718] [2022-11-16 12:16:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:37,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:16:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:16:37,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:16:37,698 INFO L87 Difference]: Start difference. First operand 1085 states and 1175 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-16 12:16:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:41,531 INFO L93 Difference]: Finished difference Result 1478 states and 1598 transitions. [2022-11-16 12:16:41,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:16:41,532 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-16 12:16:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:41,539 INFO L225 Difference]: With dead ends: 1478 [2022-11-16 12:16:41,539 INFO L226 Difference]: Without dead ends: 1478 [2022-11-16 12:16:41,539 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-16 12:16:41,540 INFO L413 NwaCegarLoop]: 974 mSDtfsCounter, 421 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:41,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1608 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-16 12:16:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-11-16 12:16:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1289. [2022-11-16 12:16:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 746 states have (on average 2.0804289544235925) internal successors, (1552), 1278 states have internal predecessors, (1552), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 12:16:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1596 transitions. [2022-11-16 12:16:41,584 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1596 transitions. Word has length 3 [2022-11-16 12:16:41,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:41,585 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1596 transitions. [2022-11-16 12:16:41,585 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-16 12:16:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1596 transitions. [2022-11-16 12:16:41,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 12:16:41,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:41,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:16:41,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:16:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:41,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-11-16 12:16:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:41,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992034486] [2022-11-16 12:16:41,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:41,800 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-16 12:16:41,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:41,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:41,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:41,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:16:42,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:42,015 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-16 12:16:42,022 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-16 12:16:42,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:16:42,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:16:42,108 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:16:42,108 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-16 12:16:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:16:42,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:42,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:42,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992034486] [2022-11-16 12:16:42,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992034486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:42,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:42,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:16:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627843288] [2022-11-16 12:16:42,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:42,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:16:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:42,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:16:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:16:42,135 INFO L87 Difference]: Start difference. First operand 1289 states and 1596 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:45,555 INFO L93 Difference]: Finished difference Result 1294 states and 1599 transitions. [2022-11-16 12:16:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:16:45,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-16 12:16:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:45,561 INFO L225 Difference]: With dead ends: 1294 [2022-11-16 12:16:45,561 INFO L226 Difference]: Without dead ends: 1294 [2022-11-16 12:16:45,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:16:45,562 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 2025 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2031 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:45,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2031 Valid, 517 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-16 12:16:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2022-11-16 12:16:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1074. [2022-11-16 12:16:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 542 states have (on average 2.0682656826568264) internal successors, (1121), 1064 states have internal predecessors, (1121), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-16 12:16:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1163 transitions. [2022-11-16 12:16:45,591 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1163 transitions. Word has length 7 [2022-11-16 12:16:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:45,592 INFO L495 AbstractCegarLoop]: Abstraction has 1074 states and 1163 transitions. [2022-11-16 12:16:45,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1163 transitions. [2022-11-16 12:16:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:16:45,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:45,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:16:45,609 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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)] Ended with exit code 0 [2022-11-16 12:16:45,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:45,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-11-16 12:16:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:45,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905865399] [2022-11-16 12:16:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:45,806 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-16 12:16:45,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:45,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:45,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:16:45,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:45,948 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-16 12:16:45,967 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-16 12:16:45,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:45,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:45,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905865399] [2022-11-16 12:16:45,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905865399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:45,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:45,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:16:45,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008889752] [2022-11-16 12:16:45,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:45,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:16:45,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:16:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:16:45,970 INFO L87 Difference]: Start difference. First operand 1074 states and 1163 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:48,452 INFO L93 Difference]: Finished difference Result 1401 states and 1517 transitions. [2022-11-16 12:16:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:16:48,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 12:16:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:48,464 INFO L225 Difference]: With dead ends: 1401 [2022-11-16 12:16:48,464 INFO L226 Difference]: Without dead ends: 1401 [2022-11-16 12:16:48,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-16 12:16:48,466 INFO L413 NwaCegarLoop]: 991 mSDtfsCounter, 986 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:48,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1296 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-16 12:16:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2022-11-16 12:16:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1027. [2022-11-16 12:16:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 542 states have (on average 1.9797047970479704) internal successors, (1073), 1017 states have internal predecessors, (1073), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-11-16 12:16:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1115 transitions. [2022-11-16 12:16:48,492 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1115 transitions. Word has length 8 [2022-11-16 12:16:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:48,493 INFO L495 AbstractCegarLoop]: Abstraction has 1027 states and 1115 transitions. [2022-11-16 12:16:48,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1115 transitions. [2022-11-16 12:16:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:16:48,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:48,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:16:48,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:48,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:48,705 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:48,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-11-16 12:16:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:48,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366400968] [2022-11-16 12:16:48,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:48,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:16:48,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:48,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:48,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:48,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:16:48,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:48,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:16:48,928 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-16 12:16:48,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:48,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:48,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366400968] [2022-11-16 12:16:48,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366400968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:48,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:48,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:16:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693394600] [2022-11-16 12:16:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:48,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:16:48,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:16:48,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:16:48,931 INFO L87 Difference]: Start difference. First operand 1027 states and 1115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:52,550 INFO L93 Difference]: Finished difference Result 1496 states and 1617 transitions. [2022-11-16 12:16:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:16:52,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 12:16:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:52,557 INFO L225 Difference]: With dead ends: 1496 [2022-11-16 12:16:52,557 INFO L226 Difference]: Without dead ends: 1496 [2022-11-16 12:16:52,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-16 12:16:52,558 INFO L413 NwaCegarLoop]: 1210 mSDtfsCounter, 686 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:52,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 1694 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-16 12:16:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-11-16 12:16:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1269. [2022-11-16 12:16:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 792 states have (on average 1.9785353535353536) internal successors, (1567), 1257 states have internal predecessors, (1567), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:16:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1613 transitions. [2022-11-16 12:16:52,591 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1613 transitions. Word has length 8 [2022-11-16 12:16:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:52,591 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1613 transitions. [2022-11-16 12:16:52,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1613 transitions. [2022-11-16 12:16:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:16:52,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:52,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:16:52,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:52,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:52,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash -657954014, now seen corresponding path program 1 times [2022-11-16 12:16:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:52,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537010255] [2022-11-16 12:16:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:52,812 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-16 12:16:52,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:52,813 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:52,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:53,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:16:53,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:53,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:16:53,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:16:53,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:16:53,019 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 30 treesize of output 39 [2022-11-16 12:16:53,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:16:53,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2022-11-16 12:16:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:16:53,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:53,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:53,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537010255] [2022-11-16 12:16:53,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537010255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:53,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:53,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:16:53,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17753160] [2022-11-16 12:16:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:53,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:16:53,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:16:53,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:16:53,119 INFO L87 Difference]: Start difference. First operand 1269 states and 1613 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:54,914 INFO L93 Difference]: Finished difference Result 1783 states and 2337 transitions. [2022-11-16 12:16:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:16:54,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-16 12:16:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:54,921 INFO L225 Difference]: With dead ends: 1783 [2022-11-16 12:16:54,921 INFO L226 Difference]: Without dead ends: 1783 [2022-11-16 12:16:54,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:16:54,922 INFO L413 NwaCegarLoop]: 1048 mSDtfsCounter, 357 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:54,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 3030 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 12:16:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-11-16 12:16:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1271. [2022-11-16 12:16:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 794 states have (on average 1.9760705289672544) internal successors, (1569), 1259 states have internal predecessors, (1569), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:16:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1615 transitions. [2022-11-16 12:16:54,954 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1615 transitions. Word has length 10 [2022-11-16 12:16:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:54,954 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1615 transitions. [2022-11-16 12:16:54,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1615 transitions. [2022-11-16 12:16:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:16:54,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:54,955 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-16 12:16:54,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:55,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-11-16 12:16:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:55,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807467973] [2022-11-16 12:16:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:55,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:16:55,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:55,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:55,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:16:55,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:55,383 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-16 12:16:55,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:55,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:55,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807467973] [2022-11-16 12:16:55,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807467973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:55,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:55,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:16:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6320839] [2022-11-16 12:16:55,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:55,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:16:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:16:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:16:55,386 INFO L87 Difference]: Start difference. First operand 1271 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-16 12:16:55,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:55,421 INFO L93 Difference]: Finished difference Result 1240 states and 1583 transitions. [2022-11-16 12:16:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:16:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-16 12:16:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:55,427 INFO L225 Difference]: With dead ends: 1240 [2022-11-16 12:16:55,427 INFO L226 Difference]: Without dead ends: 1240 [2022-11-16 12:16:55,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-16 12:16:55,428 INFO L413 NwaCegarLoop]: 1050 mSDtfsCounter, 962 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:55,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1142 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:16:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2022-11-16 12:16:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1229. [2022-11-16 12:16:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 776 states have (on average 1.9664948453608246) internal successors, (1526), 1217 states have internal predecessors, (1526), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:16:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1572 transitions. [2022-11-16 12:16:55,456 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1572 transitions. Word has length 18 [2022-11-16 12:16:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:55,457 INFO L495 AbstractCegarLoop]: Abstraction has 1229 states and 1572 transitions. [2022-11-16 12:16:55,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-16 12:16:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1572 transitions. [2022-11-16 12:16:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 12:16:55,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:55,458 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-16 12:16:55,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,671 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:55,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-11-16 12:16:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:55,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292603525] [2022-11-16 12:16:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:55,672 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-16 12:16:55,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:55,673 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:55,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:16:55,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:55,872 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-16 12:16:55,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:55,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292603525] [2022-11-16 12:16:55,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292603525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:55,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:55,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:16:55,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798035600] [2022-11-16 12:16:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:16:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:16:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:16:55,875 INFO L87 Difference]: Start difference. First operand 1229 states and 1572 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-16 12:16:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:55,969 INFO L93 Difference]: Finished difference Result 1219 states and 1555 transitions. [2022-11-16 12:16:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:16:55,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-16 12:16:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:55,977 INFO L225 Difference]: With dead ends: 1219 [2022-11-16 12:16:55,977 INFO L226 Difference]: Without dead ends: 1219 [2022-11-16 12:16:55,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-16 12:16:55,978 INFO L413 NwaCegarLoop]: 1005 mSDtfsCounter, 943 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:55,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 2095 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:16:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2022-11-16 12:16:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1207. [2022-11-16 12:16:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 768 states have (on average 1.94921875) internal successors, (1497), 1195 states have internal predecessors, (1497), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:16:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1543 transitions. [2022-11-16 12:16:56,001 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1543 transitions. Word has length 20 [2022-11-16 12:16:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:56,002 INFO L495 AbstractCegarLoop]: Abstraction has 1207 states and 1543 transitions. [2022-11-16 12:16:56,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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-16 12:16:56,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1543 transitions. [2022-11-16 12:16:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:16:56,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:56,004 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] [2022-11-16 12:16:56,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:16:56,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:56,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:56,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-11-16 12:16:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:56,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586412859] [2022-11-16 12:16:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:56,217 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-16 12:16:56,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:56,219 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:56,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:56,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:16:56,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:56,446 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-16 12:16:56,559 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-16 12:16:56,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:56,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:56,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586412859] [2022-11-16 12:16:56,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586412859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:56,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:56,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:16:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398337772] [2022-11-16 12:16:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:56,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:16:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:16:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:16:56,562 INFO L87 Difference]: Start difference. First operand 1207 states and 1543 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:59,122 INFO L93 Difference]: Finished difference Result 1795 states and 2365 transitions. [2022-11-16 12:16:59,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:16:59,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 12:16:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:59,129 INFO L225 Difference]: With dead ends: 1795 [2022-11-16 12:16:59,129 INFO L226 Difference]: Without dead ends: 1795 [2022-11-16 12:16:59,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 12:16:59,130 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 2098 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:59,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 993 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-16 12:16:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2022-11-16 12:16:59,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1203. [2022-11-16 12:16:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 768 states have (on average 1.9440104166666667) internal successors, (1493), 1191 states have internal predecessors, (1493), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:16:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1539 transitions. [2022-11-16 12:16:59,155 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1539 transitions. Word has length 34 [2022-11-16 12:16:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:59,155 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1539 transitions. [2022-11-16 12:16:59,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:16:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1539 transitions. [2022-11-16 12:16:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 12:16:59,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:59,157 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] [2022-11-16 12:16:59,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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)] Ended with exit code 0 [2022-11-16 12:16:59,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:59,369 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:16:59,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-11-16 12:16:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:16:59,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806717684] [2022-11-16 12:16:59,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:59,370 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-16 12:16:59,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:16:59,371 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:59,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:16:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:59,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:16:59,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:16:59,582 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-16 12:16:59,789 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-16 12:16:59,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:16:59,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:16:59,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806717684] [2022-11-16 12:16:59,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806717684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:59,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:59,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:16:59,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360739378] [2022-11-16 12:16:59,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:59,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:16:59,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:16:59,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:16:59,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:16:59,791 INFO L87 Difference]: Start difference. First operand 1203 states and 1539 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:03,807 INFO L93 Difference]: Finished difference Result 1437 states and 1550 transitions. [2022-11-16 12:17:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:03,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-16 12:17:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:03,811 INFO L225 Difference]: With dead ends: 1437 [2022-11-16 12:17:03,812 INFO L226 Difference]: Without dead ends: 1437 [2022-11-16 12:17:03,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 12:17:03,812 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 1176 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:03,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1723 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-16 12:17:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-11-16 12:17:03,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1199. [2022-11-16 12:17:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 768 states have (on average 1.9388020833333333) internal successors, (1489), 1187 states have internal predecessors, (1489), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:17:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1535 transitions. [2022-11-16 12:17:03,834 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1535 transitions. Word has length 34 [2022-11-16 12:17:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:03,835 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1535 transitions. [2022-11-16 12:17:03,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:03,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1535 transitions. [2022-11-16 12:17:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 12:17:03,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:03,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:03,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-11-16 12:17:04,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:04,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1045534242, now seen corresponding path program 1 times [2022-11-16 12:17:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:04,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031604169] [2022-11-16 12:17:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:04,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-16 12:17:04,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:04,051 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:04,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:04,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:17:04,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:04,327 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-16 12:17:04,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:04,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:04,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031604169] [2022-11-16 12:17:04,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031604169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:04,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:04,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585023050] [2022-11-16 12:17:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:04,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:04,330 INFO L87 Difference]: Start difference. First operand 1199 states and 1535 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:04,385 INFO L93 Difference]: Finished difference Result 1204 states and 1536 transitions. [2022-11-16 12:17:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:04,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-11-16 12:17:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:04,389 INFO L225 Difference]: With dead ends: 1204 [2022-11-16 12:17:04,389 INFO L226 Difference]: Without dead ends: 1204 [2022-11-16 12:17:04,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-16 12:17:04,390 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 912 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:04,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2073 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-11-16 12:17:04,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1193. [2022-11-16 12:17:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 762 states have (on average 1.9409448818897639) internal successors, (1479), 1181 states have internal predecessors, (1479), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-16 12:17:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1525 transitions. [2022-11-16 12:17:04,412 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1525 transitions. Word has length 49 [2022-11-16 12:17:04,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:04,412 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1525 transitions. [2022-11-16 12:17:04,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1525 transitions. [2022-11-16 12:17:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:17:04,414 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:04,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:17:04,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:04,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:04,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash -551406574, now seen corresponding path program 1 times [2022-11-16 12:17:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:04,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125558997] [2022-11-16 12:17:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:04,630 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-16 12:17:04,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:04,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:04,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:04,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:17:04,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:05,222 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-16 12:17:05,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:05,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:05,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125558997] [2022-11-16 12:17:05,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125558997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:05,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:05,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:17:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211356656] [2022-11-16 12:17:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:05,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:17:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:17:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:17:05,224 INFO L87 Difference]: Start difference. First operand 1193 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-16 12:17:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:05,509 INFO L93 Difference]: Finished difference Result 1735 states and 2262 transitions. [2022-11-16 12:17:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:17:05,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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 57 [2022-11-16 12:17:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:05,520 INFO L225 Difference]: With dead ends: 1735 [2022-11-16 12:17:05,520 INFO L226 Difference]: Without dead ends: 1735 [2022-11-16 12:17:05,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-16 12:17:05,521 INFO L413 NwaCegarLoop]: 1213 mSDtfsCounter, 407 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:05,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2069 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 12:17:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-11-16 12:17:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1556. [2022-11-16 12:17:05,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1123 states have (on average 1.9225289403383794) internal successors, (2159), 1542 states have internal predecessors, (2159), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-16 12:17:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2209 transitions. [2022-11-16 12:17:05,550 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2209 transitions. Word has length 57 [2022-11-16 12:17:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:05,551 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 2209 transitions. [2022-11-16 12:17:05,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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-16 12:17:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2209 transitions. [2022-11-16 12:17:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-16 12:17:05,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:05,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:05,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:05,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:05,767 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:05,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:05,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-11-16 12:17:05,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:05,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107880445] [2022-11-16 12:17:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:05,768 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-16 12:17:05,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:05,769 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:05,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:06,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 12:17:06,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:06,142 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-16 12:17:06,150 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-16 12:17:06,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:17:06,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-16 12:17:06,715 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:17:06,716 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-16 12:17:06,732 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-16 12:17:06,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:06,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:06,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107880445] [2022-11-16 12:17:06,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107880445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:06,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:06,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:17:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349469739] [2022-11-16 12:17:06,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:06,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:06,734 INFO L87 Difference]: Start difference. First operand 1556 states and 2209 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:09,099 INFO L93 Difference]: Finished difference Result 1527 states and 2181 transitions. [2022-11-16 12:17:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:09,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-11-16 12:17:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:09,105 INFO L225 Difference]: With dead ends: 1527 [2022-11-16 12:17:09,105 INFO L226 Difference]: Without dead ends: 1527 [2022-11-16 12:17:09,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:09,106 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 1673 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:09,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 454 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-16 12:17:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-11-16 12:17:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1108. [2022-11-16 12:17:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 718 states have (on average 1.809192200557103) internal successors, (1299), 1097 states have internal predecessors, (1299), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 12:17:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1343 transitions. [2022-11-16 12:17:09,129 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1343 transitions. Word has length 60 [2022-11-16 12:17:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:09,130 INFO L495 AbstractCegarLoop]: Abstraction has 1108 states and 1343 transitions. [2022-11-16 12:17:09,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1343 transitions. [2022-11-16 12:17:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:17:09,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:09,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:09,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:09,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:09,345 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-11-16 12:17:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:09,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678840987] [2022-11-16 12:17:09,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:09,347 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-16 12:17:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:09,348 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:09,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:09,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:17:09,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:09,707 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-16 12:17:09,723 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-16 12:17:09,756 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-16 12:17:09,769 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-16 12:17:09,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:09,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:09,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678840987] [2022-11-16 12:17:09,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678840987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:09,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:09,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630021722] [2022-11-16 12:17:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:09,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:17:09,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:09,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:17:09,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:17:09,771 INFO L87 Difference]: Start difference. First operand 1108 states and 1343 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:12,742 INFO L93 Difference]: Finished difference Result 1107 states and 1342 transitions. [2022-11-16 12:17:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-16 12:17:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:12,747 INFO L225 Difference]: With dead ends: 1107 [2022-11-16 12:17:12,747 INFO L226 Difference]: Without dead ends: 1107 [2022-11-16 12:17:12,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-16 12:17:12,747 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 4 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:12,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2524 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-16 12:17:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-11-16 12:17:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1107. [2022-11-16 12:17:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 718 states have (on average 1.807799442896936) internal successors, (1298), 1096 states have internal predecessors, (1298), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 12:17:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 1342 transitions. [2022-11-16 12:17:12,764 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 1342 transitions. Word has length 65 [2022-11-16 12:17:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:12,765 INFO L495 AbstractCegarLoop]: Abstraction has 1107 states and 1342 transitions. [2022-11-16 12:17:12,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1342 transitions. [2022-11-16 12:17:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:17:12,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:12,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:12,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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)] Ended with exit code 0 [2022-11-16 12:17:12,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:12,980 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:12,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-11-16 12:17:12,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:12,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332331526] [2022-11-16 12:17:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:12,981 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-16 12:17:12,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:12,983 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:13,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:13,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 12:17:13,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:13,329 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-16 12:17:13,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:17:13,377 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-16 12:17:13,431 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-16 12:17:13,438 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-16 12:17:13,455 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-16 12:17:13,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:13,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:13,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332331526] [2022-11-16 12:17:13,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332331526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:13,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:13,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211279417] [2022-11-16 12:17:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:13,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:17:13,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:13,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:17:13,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:17:13,457 INFO L87 Difference]: Start difference. First operand 1107 states and 1342 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:17,834 INFO L93 Difference]: Finished difference Result 1106 states and 1341 transitions. [2022-11-16 12:17:17,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:17:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2022-11-16 12:17:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:17,839 INFO L225 Difference]: With dead ends: 1106 [2022-11-16 12:17:17,840 INFO L226 Difference]: Without dead ends: 1106 [2022-11-16 12:17:17,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-16 12:17:17,840 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:17,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2569 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-16 12:17:17,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2022-11-16 12:17:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106. [2022-11-16 12:17:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 717 states have (on average 1.808926080892608) internal successors, (1297), 1095 states have internal predecessors, (1297), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-16 12:17:17,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1341 transitions. [2022-11-16 12:17:17,858 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1341 transitions. Word has length 65 [2022-11-16 12:17:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:17,859 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1341 transitions. [2022-11-16 12:17:17,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:17:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1341 transitions. [2022-11-16 12:17:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-16 12:17:17,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:17,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:17,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:18,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:18,075 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash -599006260, now seen corresponding path program 1 times [2022-11-16 12:17:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:18,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341924774] [2022-11-16 12:17:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:18,076 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-16 12:17:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:18,076 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:18,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:18,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:17:18,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:18,409 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-16 12:17:18,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:17:18,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:18,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341924774] [2022-11-16 12:17:18,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341924774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:18,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:18,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:17:18,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775501815] [2022-11-16 12:17:18,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:18,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:17:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:18,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:17:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:17:18,412 INFO L87 Difference]: Start difference. First operand 1106 states and 1341 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:17:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:18,477 INFO L93 Difference]: Finished difference Result 1109 states and 1345 transitions. [2022-11-16 12:17:18,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:17:18,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-11-16 12:17:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:18,483 INFO L225 Difference]: With dead ends: 1109 [2022-11-16 12:17:18,483 INFO L226 Difference]: Without dead ends: 1109 [2022-11-16 12:17:18,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-16 12:17:18,484 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:18,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2866 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:17:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-11-16 12:17:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1109. [2022-11-16 12:17:18,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 719 states have (on average 1.8080667593880388) internal successors, (1300), 1098 states have internal predecessors, (1300), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-16 12:17:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1345 transitions. [2022-11-16 12:17:18,508 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1345 transitions. Word has length 73 [2022-11-16 12:17:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:18,509 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1345 transitions. [2022-11-16 12:17:18,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:17:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1345 transitions. [2022-11-16 12:17:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-16 12:17:18,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:18,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:18,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:18,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:18,726 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash -481982235, now seen corresponding path program 1 times [2022-11-16 12:17:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:18,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739987085] [2022-11-16 12:17:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:18,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-16 12:17:18,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:18,728 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:18,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:19,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:17:19,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:19,156 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-16 12:17:19,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:19,290 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-16 12:17:19,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:19,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739987085] [2022-11-16 12:17:19,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739987085] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:19,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:19,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-16 12:17:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683868775] [2022-11-16 12:17:19,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:19,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:17:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:17:19,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:17:19,293 INFO L87 Difference]: Start difference. First operand 1109 states and 1345 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:19,540 INFO L93 Difference]: Finished difference Result 1121 states and 1362 transitions. [2022-11-16 12:17:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:17:19,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2022-11-16 12:17:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:19,545 INFO L225 Difference]: With dead ends: 1121 [2022-11-16 12:17:19,545 INFO L226 Difference]: Without dead ends: 1121 [2022-11-16 12:17:19,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:17:19,546 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 25 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:19,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2870 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:17:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2022-11-16 12:17:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1119. [2022-11-16 12:17:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 728 states have (on average 1.8063186813186813) internal successors, (1315), 1107 states have internal predecessors, (1315), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-16 12:17:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1360 transitions. [2022-11-16 12:17:19,567 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1360 transitions. Word has length 74 [2022-11-16 12:17:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:19,567 INFO L495 AbstractCegarLoop]: Abstraction has 1119 states and 1360 transitions. [2022-11-16 12:17:19,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1360 transitions. [2022-11-16 12:17:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-16 12:17:19,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:19,569 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:19,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:19,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:19,783 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1608982004, now seen corresponding path program 2 times [2022-11-16 12:17:19,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:19,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831046171] [2022-11-16 12:17:19,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:17:19,784 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-16 12:17:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:19,785 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:19,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:20,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:17:20,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:17:20,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:17:20,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:20,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:20,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:20,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831046171] [2022-11-16 12:17:20,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831046171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:20,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:20,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 12:17:20,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970009972] [2022-11-16 12:17:20,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:20,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 12:17:20,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:20,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 12:17:20,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:17:20,680 INFO L87 Difference]: Start difference. First operand 1119 states and 1360 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:21,543 INFO L93 Difference]: Finished difference Result 1140 states and 1388 transitions. [2022-11-16 12:17:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 12:17:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-11-16 12:17:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:21,548 INFO L225 Difference]: With dead ends: 1140 [2022-11-16 12:17:21,549 INFO L226 Difference]: Without dead ends: 1136 [2022-11-16 12:17:21,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-11-16 12:17:21,550 INFO L413 NwaCegarLoop]: 961 mSDtfsCounter, 55 mSDsluCounter, 6691 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 7652 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:21,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 7652 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 12:17:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-11-16 12:17:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1128. [2022-11-16 12:17:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 737 states have (on average 1.8005427408412482) internal successors, (1327), 1116 states have internal predecessors, (1327), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-16 12:17:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1372 transitions. [2022-11-16 12:17:21,573 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1372 transitions. Word has length 77 [2022-11-16 12:17:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:21,574 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 1372 transitions. [2022-11-16 12:17:21,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1372 transitions. [2022-11-16 12:17:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-16 12:17:21,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:21,575 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:21,596 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:21,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:21,791 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash 590103404, now seen corresponding path program 3 times [2022-11-16 12:17:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:21,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564968662] [2022-11-16 12:17:21,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:17:21,792 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-16 12:17:21,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:21,793 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:21,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:22,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-16 12:17:22,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:17:22,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 12:17:22,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:22,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:23,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:23,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564968662] [2022-11-16 12:17:23,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564968662] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:23,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:23,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-16 12:17:23,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290085612] [2022-11-16 12:17:23,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:23,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:17:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:23,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:17:23,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:17:23,818 INFO L87 Difference]: Start difference. First operand 1128 states and 1372 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:28,338 INFO L93 Difference]: Finished difference Result 1170 states and 1434 transitions. [2022-11-16 12:17:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 12:17:28,339 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2022-11-16 12:17:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:28,350 INFO L225 Difference]: With dead ends: 1170 [2022-11-16 12:17:28,350 INFO L226 Difference]: Without dead ends: 1164 [2022-11-16 12:17:28,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 12:17:28,352 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 153 mSDsluCounter, 14385 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 15351 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:28,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 15351 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-16 12:17:28,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2022-11-16 12:17:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1146. [2022-11-16 12:17:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 755 states have (on average 1.7880794701986755) internal successors, (1350), 1134 states have internal predecessors, (1350), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-16 12:17:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1395 transitions. [2022-11-16 12:17:28,376 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1395 transitions. Word has length 83 [2022-11-16 12:17:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:28,376 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1395 transitions. [2022-11-16 12:17:28,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1395 transitions. [2022-11-16 12:17:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-16 12:17:28,378 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:28,378 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:28,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:28,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:28,594 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1945464364, now seen corresponding path program 4 times [2022-11-16 12:17:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:28,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542808517] [2022-11-16 12:17:28,596 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 12:17:28,596 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-16 12:17:28,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:28,597 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:28,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:29,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 12:17:29,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:17:29,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:17:29,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:29,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:32,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:32,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542808517] [2022-11-16 12:17:32,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542808517] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:32,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:32,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-11-16 12:17:32,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728403848] [2022-11-16 12:17:32,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:32,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-16 12:17:32,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:17:32,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-16 12:17:32,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-11-16 12:17:32,203 INFO L87 Difference]: Start difference. First operand 1146 states and 1395 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:44,868 INFO L93 Difference]: Finished difference Result 1226 states and 1507 transitions. [2022-11-16 12:17:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 12:17:44,869 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2022-11-16 12:17:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:44,877 INFO L225 Difference]: With dead ends: 1226 [2022-11-16 12:17:44,877 INFO L226 Difference]: Without dead ends: 1222 [2022-11-16 12:17:44,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-11-16 12:17:44,881 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 429 mSDsluCounter, 22406 mSDsCounter, 0 mSdLazyCounter, 2417 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 23384 SdHoareTripleChecker+Invalid, 2793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:44,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 23384 Invalid, 2793 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [376 Valid, 2417 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-16 12:17:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2022-11-16 12:17:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1180. [2022-11-16 12:17:44,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 789 states have (on average 1.7693282636248415) internal successors, (1396), 1168 states have internal predecessors, (1396), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-16 12:17:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1441 transitions. [2022-11-16 12:17:44,920 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1441 transitions. Word has length 95 [2022-11-16 12:17:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:44,920 INFO L495 AbstractCegarLoop]: Abstraction has 1180 states and 1441 transitions. [2022-11-16 12:17:44,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:17:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1441 transitions. [2022-11-16 12:17:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 12:17:44,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:44,922 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:17:44,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:45,139 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:17:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2045448052, now seen corresponding path program 5 times [2022-11-16 12:17:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:17:45,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530598218] [2022-11-16 12:17:45,140 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:17:45,140 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-16 12:17:45,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:17:45,142 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:45,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:17:46,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 12:17:46,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:17:46,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 12:17:46,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:17:46,948 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-16 12:17:47,124 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:17:47,125 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-16 12:17:47,156 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-16 12:17:47,282 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 24 treesize of output 12 [2022-11-16 12:17:47,397 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:17:48,441 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940)))) is different from true [2022-11-16 12:17:48,619 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945)))) is different from true [2022-11-16 12:17:49,088 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:17:49,198 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:17:49,199 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-16 12:17:49,245 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-16 12:17:49,290 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 780 trivial. 170 not checked. [2022-11-16 12:17:49,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:17:49,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2004 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2004) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2022-11-16 12:17:49,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:17:49,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530598218] [2022-11-16 12:17:49,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530598218] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:17:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [489368271] [2022-11-16 12:17:49,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 12:17:49,689 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:17:49,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:17:49,690 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:17:49,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-16 12:19:04,266 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-16 12:19:04,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:19:04,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 12:19:04,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:04,509 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-16 12:19:04,644 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 12:19:04,644 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-16 12:19:04,660 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-16 12:19:04,722 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 24 treesize of output 12 [2022-11-16 12:19:04,829 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:04,849 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380)))) is different from true [2022-11-16 12:19:05,339 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394)))) is different from true [2022-11-16 12:19:05,387 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396)))) is different from true [2022-11-16 12:19:05,476 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:05,602 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:05,790 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409)))) is different from true [2022-11-16 12:19:05,858 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:05,876 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412)))) is different from true [2022-11-16 12:19:05,893 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413)))) is different from true [2022-11-16 12:19:05,945 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2415)))) is different from true [2022-11-16 12:19:06,102 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2420) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:06,191 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:19:06,191 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-16 12:19:06,247 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-16 12:19:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 496 trivial. 462 not checked. [2022-11-16 12:19:06,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:08,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [489368271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:08,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:19:08,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 24 [2022-11-16 12:19:08,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753082615] [2022-11-16 12:19:08,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:19:08,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 12:19:08,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:19:08,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 12:19:08,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=110, Unknown=27, NotChecked=612, Total=812 [2022-11-16 12:19:08,623 INFO L87 Difference]: Start difference. First operand 1180 states and 1441 transitions. Second operand has 25 states, 23 states have (on average 4.434782608695652) internal successors, (102), 25 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:19:09,126 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:09,133 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2415))) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2420) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:09,140 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2415))) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2420) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412)))) is different from true [2022-11-16 12:19:09,155 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)) (_ bv0 1)) (not (= v_arrayElimCell_16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_2396 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2396))) (exists ((v_ArrVal_2415 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2415))) (exists ((v_ArrVal_2409 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2409))) (exists ((v_ArrVal_2413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2413))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_ArrVal_2403 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2403) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2411) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2394 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2394))) (exists ((v_ArrVal_2379 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2379) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2380 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2380))) (exists ((v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2420) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_2399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2399) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2412 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2412)))) is different from true [2022-11-16 12:19:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:13,386 INFO L93 Difference]: Finished difference Result 1190 states and 1449 transitions. [2022-11-16 12:19:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:19:13,393 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.434782608695652) internal successors, (102), 25 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 117 [2022-11-16 12:19:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:13,396 INFO L225 Difference]: With dead ends: 1190 [2022-11-16 12:19:13,396 INFO L226 Difference]: Without dead ends: 1186 [2022-11-16 12:19:13,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 74 SemanticMatches, 34 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=90, Invalid=170, Unknown=34, NotChecked=966, Total=1260 [2022-11-16 12:19:13,397 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 798 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 1784 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 19239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17448 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:13,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 3154 Invalid, 19239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1784 Invalid, 0 Unknown, 17448 Unchecked, 4.5s Time] [2022-11-16 12:19:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-11-16 12:19:13,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1179. [2022-11-16 12:19:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 789 states have (on average 1.7629911280101394) internal successors, (1391), 1167 states have internal predecessors, (1391), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-11-16 12:19:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1436 transitions. [2022-11-16 12:19:13,419 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1436 transitions. Word has length 117 [2022-11-16 12:19:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:13,420 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1436 transitions. [2022-11-16 12:19:13,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.434782608695652) internal successors, (102), 25 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-16 12:19:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1436 transitions. [2022-11-16 12:19:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-16 12:19:13,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:13,422 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:19:13,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:13,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:13,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt [2022-11-16 12:19:13,842 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-11-16 12:19:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2045448051, now seen corresponding path program 1 times [2022-11-16 12:19:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:19:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968559479] [2022-11-16 12:19:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:13,843 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-16 12:19:13,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:19:13,844 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:19:13,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/mathsat -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-16 12:19:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:14,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-16 12:19:14,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:14,656 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-16 12:19:14,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:19:14,824 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:19:14,824 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-16 12:19:14,860 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-16 12:19:14,885 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-16 12:19:15,008 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 22 treesize of output 10 [2022-11-16 12:19:15,014 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 9 treesize of output 3 [2022-11-16 12:19:15,161 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:15,177 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850)))) is different from true [2022-11-16 12:19:15,191 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852)))) is different from true [2022-11-16 12:19:15,206 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854)))) is different from true [2022-11-16 12:19:15,222 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:15,237 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858)))) is different from true [2022-11-16 12:19:15,251 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2860 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2860) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,264 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2862 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2862))) (exists ((v_ArrVal_2861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2861) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:15,279 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2864 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2864) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2863 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2863)))) is different from true [2022-11-16 12:19:15,292 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2866 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2866))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2865 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2865) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,306 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2868 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2868) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2867 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2867) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,355 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:19:15,369 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:19:15,384 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2876))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2875)))) is different from true [2022-11-16 12:19:15,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,484 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2883)))) is different from true [2022-11-16 12:19:15,500 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2886) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2885))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:19:15,515 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2888))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887)))) is different from true [2022-11-16 12:19:15,530 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2889 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2889) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2890))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:19:15,545 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2891)))) is different from true [2022-11-16 12:19:15,559 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2893 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2893))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2894)))) is different from true [2022-11-16 12:19:15,574 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2896))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2895) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:15,587 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2898))) (exists ((v_ArrVal_2897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2897)))) is different from true [2022-11-16 12:19:15,603 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,616 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2901))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2902)))) is different from true [2022-11-16 12:19:15,640 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2022-11-16 12:19:15,654 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2906))) (exists ((v_ArrVal_2905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2905)))) is different from true [2022-11-16 12:19:15,667 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2908 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2908) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:19:15,686 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2909))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-11-16 12:19:15,703 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2911))) (exists ((v_ArrVal_2912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2912) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:19:15,720 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2913))) (exists ((v_ArrVal_2914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2914)))) is different from true [2022-11-16 12:19:15,736 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,752 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:19:15,767 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920)))) is different from true [2022-11-16 12:19:15,783 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2922))) (exists ((v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2921)))) is different from true [2022-11-16 12:19:15,798 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2924))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,814 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2925))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2926)))) is different from true [2022-11-16 12:19:15,829 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2927))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2928)))) is different from true [2022-11-16 12:19:15,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2930 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2930) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2929) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:19:15,898 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:19:15,898 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-16 12:19:15,913 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-16 12:19:15,963 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-16 12:19:15,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:19:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-11-16 12:19:16,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:17,189 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3022) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-16 12:19:17,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:19:17,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968559479] [2022-11-16 12:19:17,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968559479] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:17,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1321712188] [2022-11-16 12:19:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:17,201 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 12:19:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 12:19:17,203 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 12:19:17,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ba221bfb-d583-4e47-95b7-110bfa5c9d28/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-16 12:21:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:10,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-16 12:21:10,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:21:10,445 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-16 12:21:10,657 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:21:10,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-16 12:21:10,669 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-16 12:21:10,684 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-16 12:21:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:21:10,799 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 22 treesize of output 10 [2022-11-16 12:21:10,806 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 9 treesize of output 3 [2022-11-16 12:21:10,934 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3400 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3400) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3401 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3401)))) is different from true [2022-11-16 12:21:10,953 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3403 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3403))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3402 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3402)))) is different from true [2022-11-16 12:21:10,972 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3404 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3404))) (exists ((v_ArrVal_3405 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3405)))) is different from true [2022-11-16 12:21:10,990 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3406 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3406) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3407 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3407) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:21:11,008 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3409 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3409) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3408 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3408) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,030 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3410))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3411 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3411) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:21:11,048 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3413 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3413))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3412 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3412) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,064 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3415 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3415) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3414)))) is different from true [2022-11-16 12:21:11,159 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3421 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3421) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3420)))) is different from true [2022-11-16 12:21:11,174 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3423 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3423))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3422 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3422)))) is different from true [2022-11-16 12:21:11,191 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3424 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3424) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3425 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3425)))) is different from true [2022-11-16 12:21:11,207 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3427 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3427))) (exists ((v_ArrVal_3426 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3426) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,222 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3428 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3428))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3429 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3429) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:21:11,237 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3430 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3430))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3431 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3431) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,252 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3432 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3432))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3433 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3433) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:21:11,267 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3435 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3435))) (exists ((v_ArrVal_3434 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3434)))) is different from true [2022-11-16 12:21:11,285 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3437 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3437))) (exists ((v_ArrVal_3436 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3436)))) is different from true [2022-11-16 12:21:11,303 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3438) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3439 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3439)))) is different from true [2022-11-16 12:21:11,320 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3441 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3441))) (exists ((v_ArrVal_3440 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3440)))) is different from true [2022-11-16 12:21:11,337 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3442 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3442) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3443 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3443)))) is different from true [2022-11-16 12:21:11,355 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3444 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3444))) (exists ((v_ArrVal_3445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3445) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:21:11,372 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3447 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3447))) (exists ((v_ArrVal_3446 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3446) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-16 12:21:11,389 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3448 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3448))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3449 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3449)))) is different from true [2022-11-16 12:21:11,406 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3450))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3451 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3451)))) is different from true [2022-11-16 12:21:11,421 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3453 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3453))) (exists ((v_ArrVal_3452 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3452) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,436 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3455 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3455))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3454 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3454)))) is different from true [2022-11-16 12:21:11,454 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3457 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3457) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3456)))) is different from true [2022-11-16 12:21:11,473 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3458 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3458) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3459 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3459))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:21:11,491 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3460))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3461)))) is different from true [2022-11-16 12:21:11,509 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3463))) (exists ((v_ArrVal_3462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3462)))) is different from true [2022-11-16 12:21:11,527 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3464))) (exists ((v_ArrVal_3465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3465)))) is different from true [2022-11-16 12:21:11,590 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3469))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3468 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3468)))) is different from true [2022-11-16 12:21:11,608 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3470) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3471)))) is different from true [2022-11-16 12:21:11,626 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3473))) (exists ((v_ArrVal_3472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3472)))) is different from true [2022-11-16 12:21:11,644 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3474) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3475)))) is different from true [2022-11-16 12:21:11,707 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3479))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3478) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,726 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3480 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3480))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3481) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,744 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3483 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3483))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_3482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3482) |c_#memory_$Pointer$.base|))) is different from true [2022-11-16 12:21:11,798 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3484))) (exists ((v_ArrVal_3485 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3485) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-11-16 12:21:11,864 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:21:11,864 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-16 12:21:11,873 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-16 12:21:11,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-11-16 12:21:11,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:21:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-11-16 12:21:11,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:21:13,163 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3576) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2022-11-16 12:21:13,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1321712188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:13,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:21:13,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 86 [2022-11-16 12:21:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868020200] [2022-11-16 12:21:13,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:21:13,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-16 12:21:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:21:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-16 12:21:13,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=162, Unknown=85, NotChecked=7760, Total=8190 [2022-11-16 12:21:13,175 INFO L87 Difference]: Start difference. First operand 1179 states and 1436 transitions. Second operand has 87 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 87 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:21:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:20,713 INFO L93 Difference]: Finished difference Result 1186 states and 1443 transitions. [2022-11-16 12:21:20,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:21:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 87 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117 [2022-11-16 12:21:20,715 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-11-16 12:21:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 87 states have internal predecessors, (159), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 117