./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:51:55,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:51:55,204 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:51:55,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:51:55,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:51:55,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:51:55,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:51:55,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:51:55,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:51:55,237 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:51:55,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:51:55,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:51:55,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:51:55,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:51:55,240 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:51:55,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:51:55,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:51:55,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:51:55,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:51:55,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:51:55,243 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:51:55,244 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:51:55,245 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:51:55,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:51:55,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:51:55,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:51:55,246 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:51:55,247 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:51:55,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:51:55,248 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:51:55,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:51:55,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:51:55,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:51:55,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:51:55,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:51:55,249 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:51:55,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:51:55,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:51:55,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:51:55,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:51:55,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:51:55,250 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/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_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2023-11-29 02:51:55,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:51:55,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:51:55,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:51:55,467 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:51:55,468 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:51:55,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2023-11-29 02:51:58,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:51:58,495 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:51:58,496 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2023-11-29 02:51:58,515 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data/82cfec1f2/dbf8f05dc6064f7b8614c5a0fb5da90d/FLAG0dcc72647 [2023-11-29 02:51:58,528 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data/82cfec1f2/dbf8f05dc6064f7b8614c5a0fb5da90d [2023-11-29 02:51:58,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:51:58,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:51:58,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:51:58,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:51:58,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:51:58,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:51:58" (1/1) ... [2023-11-29 02:51:58,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41aca759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:58, skipping insertion in model container [2023-11-29 02:51:58,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:51:58" (1/1) ... [2023-11-29 02:51:58,601 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:51:59,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:51:59,136 ERROR L324 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) [2023-11-29 02:51:59,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1855d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:51:59, skipping insertion in model container [2023-11-29 02:51:59,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:51:59,138 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 02:51:59,139 INFO L158 Benchmark]: Toolchain (without parser) took 606.25ms. Allocated memory is still 178.3MB. Free memory was 144.5MB in the beginning and 122.7MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 02:51:59,140 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:51:59,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.73ms. Allocated memory is still 178.3MB. Free memory was 144.5MB in the beginning and 122.7MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 02:51:59,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.73ms. Allocated memory is still 178.3MB. Free memory was 144.5MB in the beginning and 122.7MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:52:00,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:52:01,037 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:52:01,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:52:01,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:52:01,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:52:01,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:52:01,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:52:01,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:52:01,079 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:52:01,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:52:01,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:52:01,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:52:01,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:52:01,082 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:52:01,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:52:01,083 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:52:01,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:52:01,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:52:01,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:52:01,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:52:01,086 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:52:01,086 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:52:01,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:52:01,087 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:52:01,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:52:01,088 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:52:01,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:52:01,089 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:52:01,089 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:52:01,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:52:01,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:52:01,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:52:01,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:52:01,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:52:01,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:52:01,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:52:01,091 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:52:01,092 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:52:01,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:52:01,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:52:01,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:52:01,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:52:01,093 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:52:01,093 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/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_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2023-11-29 02:52:01,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:52:01,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:52:01,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:52:01,408 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:52:01,408 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:52:01,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2023-11-29 02:52:04,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:52:04,435 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:52:04,436 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-3.i [2023-11-29 02:52:04,454 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data/df48cab46/1be4049e40dc47c682d1a55a011fc401/FLAGe1abb198e [2023-11-29 02:52:04,467 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/data/df48cab46/1be4049e40dc47c682d1a55a011fc401 [2023-11-29 02:52:04,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:52:04,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:52:04,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:52:04,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:52:04,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:52:04,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:52:04" (1/1) ... [2023-11-29 02:52:04,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6238235b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:04, skipping insertion in model container [2023-11-29 02:52:04,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:52:04" (1/1) ... [2023-11-29 02:52:04,536 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:52:05,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:52:05,083 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 02:52:05,096 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:52:05,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:52:05,191 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:52:05,282 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:52:05,319 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:52:05,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05 WrapperNode [2023-11-29 02:52:05,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:52:05,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:52:05,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:52:05,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:52:05,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,429 INFO L138 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1449 [2023-11-29 02:52:05,429 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:52:05,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:52:05,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:52:05,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:52:05,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,644 INFO L175 MemorySlicer]: Split 413 memory accesses to 4 slices as follows [2, 5, 5, 401]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 100 writes are split as follows [0, 1, 1, 98]. [2023-11-29 02:52:05,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:52:05,727 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:52:05,727 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:52:05,727 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:52:05,728 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (1/1) ... [2023-11-29 02:52:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:52:05,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:52:05,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:52:05,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 02:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 02:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 02:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 02:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:52:05,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 02:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 02:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 02:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 02:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 02:52:05,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 02:52:05,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 02:52:05,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 02:52:05,794 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 02:52:05,795 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 02:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:52:05,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:52:05,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:52:05,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:52:05,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:52:06,058 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:52:06,060 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:52:06,065 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:52:06,119 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:52:06,140 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:52:06,161 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:52:12,229 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:52:12,473 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:52:12,473 INFO L309 CfgBuilder]: Removed 77 assume(true) statements. [2023-11-29 02:52:12,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:52:12 BoogieIcfgContainer [2023-11-29 02:52:12,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:52:12,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:52:12,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:52:12,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:52:12,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:52:04" (1/3) ... [2023-11-29 02:52:12,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df25f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:52:12, skipping insertion in model container [2023-11-29 02:52:12,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:52:05" (2/3) ... [2023-11-29 02:52:12,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df25f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:52:12, skipping insertion in model container [2023-11-29 02:52:12,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:52:12" (3/3) ... [2023-11-29 02:52:12,483 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-3.i [2023-11-29 02:52:12,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:52:12,505 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2023-11-29 02:52:12,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:52:12,584 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=PETRI_NET, 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;@2cae3153, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:52:12,585 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2023-11-29 02:52:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 1485 states, 632 states have (on average 2.5838607594936707) internal successors, (1633), 1477 states have internal predecessors, (1633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:52:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 02:52:12,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:12,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 02:52:12,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr850ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:12,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2385053, now seen corresponding path program 1 times [2023-11-29 02:52:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538291885] [2023-11-29 02:52:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:12,621 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 [2023-11-29 02:52:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:12,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:12,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:12,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:52:12,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:12,848 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:12,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538291885] [2023-11-29 02:52:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538291885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:52:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009501072] [2023-11-29 02:52:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:12,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:52:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:52:12,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:12,910 INFO L87 Difference]: Start difference. First operand has 1485 states, 632 states have (on average 2.5838607594936707) internal successors, (1633), 1477 states have internal predecessors, (1633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2023-11-29 02:52:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:16,110 INFO L93 Difference]: Finished difference Result 1812 states and 1907 transitions. [2023-11-29 02:52:16,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:52:16,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 [2023-11-29 02:52:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:16,134 INFO L225 Difference]: With dead ends: 1812 [2023-11-29 02:52:16,134 INFO L226 Difference]: Without dead ends: 1809 [2023-11-29 02:52:16,135 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 [2023-11-29 02:52:16,139 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 364 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:16,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2078 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 02:52:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2023-11-29 02:52:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1480. [2023-11-29 02:52:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 638 states have (on average 2.4357366771159876) internal successors, (1554), 1472 states have internal predecessors, (1554), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:52:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1566 transitions. [2023-11-29 02:52:16,228 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1566 transitions. Word has length 3 [2023-11-29 02:52:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:16,228 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1566 transitions. [2023-11-29 02:52:16,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2023-11-29 02:52:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1566 transitions. [2023-11-29 02:52:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:52:16,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:16,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:52:16,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:16,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:16,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:16,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2005150439, now seen corresponding path program 1 times [2023-11-29 02:52:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95499481] [2023-11-29 02:52:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:16,432 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 [2023-11-29 02:52:16,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:16,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:16,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:16,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:52:16,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:16,630 INFO L378 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 [2023-11-29 02:52:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:16,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:16,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95499481] [2023-11-29 02:52:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95499481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:16,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:16,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:52:16,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240682820] [2023-11-29 02:52:16,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:16,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:52:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:16,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:52:16,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:16,644 INFO L87 Difference]: Start difference. First operand 1480 states and 1566 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:19,340 INFO L93 Difference]: Finished difference Result 1510 states and 1607 transitions. [2023-11-29 02:52:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:52:19,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 02:52:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:19,347 INFO L225 Difference]: With dead ends: 1510 [2023-11-29 02:52:19,347 INFO L226 Difference]: Without dead ends: 1510 [2023-11-29 02:52:19,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:19,349 INFO L413 NwaCegarLoop]: 777 mSDtfsCounter, 1029 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:19,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1030 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 02:52:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2023-11-29 02:52:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1453. [2023-11-29 02:52:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 704 states have (on average 2.25) internal successors, (1584), 1445 states have internal predecessors, (1584), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:52:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1596 transitions. [2023-11-29 02:52:19,376 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1596 transitions. Word has length 5 [2023-11-29 02:52:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:19,376 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1596 transitions. [2023-11-29 02:52:19,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1596 transitions. [2023-11-29 02:52:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:52:19,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:19,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:52:19,379 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 02:52:19,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:19,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:19,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:19,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2005150438, now seen corresponding path program 1 times [2023-11-29 02:52:19,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:19,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103520233] [2023-11-29 02:52:19,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:19,579 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 [2023-11-29 02:52:19,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:19,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:19,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:19,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:52:19,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:19,711 INFO L378 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 [2023-11-29 02:52:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:19,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:19,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:19,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103520233] [2023-11-29 02:52:19,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103520233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:19,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:19,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:52:19,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877512685] [2023-11-29 02:52:19,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:19,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:52:19,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:19,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:52:19,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:19,736 INFO L87 Difference]: Start difference. First operand 1453 states and 1596 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:23,757 INFO L93 Difference]: Finished difference Result 1725 states and 1888 transitions. [2023-11-29 02:52:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:52:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 02:52:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:23,765 INFO L225 Difference]: With dead ends: 1725 [2023-11-29 02:52:23,765 INFO L226 Difference]: Without dead ends: 1725 [2023-11-29 02:52:23,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:23,766 INFO L413 NwaCegarLoop]: 1105 mSDtfsCounter, 456 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:23,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1626 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 02:52:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2023-11-29 02:52:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1576. [2023-11-29 02:52:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 837 states have (on average 2.218637992831541) internal successors, (1857), 1568 states have internal predecessors, (1857), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:52:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1869 transitions. [2023-11-29 02:52:23,798 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1869 transitions. Word has length 5 [2023-11-29 02:52:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:23,798 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 1869 transitions. [2023-11-29 02:52:23,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1869 transitions. [2023-11-29 02:52:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:52:23,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:23,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:52:23,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:24,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:24,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:24,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2028430167, now seen corresponding path program 1 times [2023-11-29 02:52:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:24,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449636263] [2023-11-29 02:52:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:24,002 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 [2023-11-29 02:52:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:24,003 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:24,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:24,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:52:24,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:24,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:24,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:24,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449636263] [2023-11-29 02:52:24,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449636263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:24,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:24,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:52:24,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287826117] [2023-11-29 02:52:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:24,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:52:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:52:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:24,148 INFO L87 Difference]: Start difference. First operand 1576 states and 1869 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:26,758 INFO L93 Difference]: Finished difference Result 2679 states and 3172 transitions. [2023-11-29 02:52:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:52:26,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:26,768 INFO L225 Difference]: With dead ends: 2679 [2023-11-29 02:52:26,768 INFO L226 Difference]: Without dead ends: 2679 [2023-11-29 02:52:26,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:26,770 INFO L413 NwaCegarLoop]: 1275 mSDtfsCounter, 1072 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:26,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 3550 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 02:52:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2023-11-29 02:52:26,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2022. [2023-11-29 02:52:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1283 states have (on average 2.176149649259548) internal successors, (2792), 2011 states have internal predecessors, (2792), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2810 transitions. [2023-11-29 02:52:26,811 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2810 transitions. Word has length 6 [2023-11-29 02:52:26,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:26,812 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 2810 transitions. [2023-11-29 02:52:26,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2810 transitions. [2023-11-29 02:52:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 02:52:26,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:26,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:26,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 02:52:27,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:27,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr647REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:27,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:27,014 INFO L85 PathProgramCache]: Analyzing trace with hash 593798675, now seen corresponding path program 1 times [2023-11-29 02:52:27,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:27,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101798353] [2023-11-29 02:52:27,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:27,015 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 [2023-11-29 02:52:27,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:27,016 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:27,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:27,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:52:27,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:27,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:27,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101798353] [2023-11-29 02:52:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101798353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:27,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:52:27,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852332705] [2023-11-29 02:52:27,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:27,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:52:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:52:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:27,206 INFO L87 Difference]: Start difference. First operand 2022 states and 2810 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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) [2023-11-29 02:52:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:28,815 INFO L93 Difference]: Finished difference Result 2304 states and 2944 transitions. [2023-11-29 02:52:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:52:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 [2023-11-29 02:52:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:28,830 INFO L225 Difference]: With dead ends: 2304 [2023-11-29 02:52:28,830 INFO L226 Difference]: Without dead ends: 2304 [2023-11-29 02:52:28,830 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 [2023-11-29 02:52:28,831 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 543 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:28,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2487 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 02:52:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2023-11-29 02:52:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1913. [2023-11-29 02:52:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1174 states have (on average 2.183986371379898) internal successors, (2564), 1902 states have internal predecessors, (2564), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2582 transitions. [2023-11-29 02:52:28,872 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2582 transitions. Word has length 8 [2023-11-29 02:52:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:28,873 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2582 transitions. [2023-11-29 02:52:28,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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) [2023-11-29 02:52:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2582 transitions. [2023-11-29 02:52:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:52:28,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:28,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:28,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 02:52:29,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:29,075 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr649REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:29,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1106372499, now seen corresponding path program 1 times [2023-11-29 02:52:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045864644] [2023-11-29 02:52:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:29,077 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 [2023-11-29 02:52:29,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:29,078 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:29,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:29,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:52:29,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:29,266 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:29,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045864644] [2023-11-29 02:52:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045864644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:29,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:52:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027778658] [2023-11-29 02:52:29,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:29,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:52:29,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:52:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:29,269 INFO L87 Difference]: Start difference. First operand 1913 states and 2582 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:31,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:31,708 INFO L93 Difference]: Finished difference Result 2304 states and 2943 transitions. [2023-11-29 02:52:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:52:31,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-29 02:52:31,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:31,719 INFO L225 Difference]: With dead ends: 2304 [2023-11-29 02:52:31,719 INFO L226 Difference]: Without dead ends: 2298 [2023-11-29 02:52:31,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:31,720 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 549 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:31,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 3619 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 02:52:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2023-11-29 02:52:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1907. [2023-11-29 02:52:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1168 states have (on average 2.1892123287671232) internal successors, (2557), 1896 states have internal predecessors, (2557), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2575 transitions. [2023-11-29 02:52:31,790 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2575 transitions. Word has length 11 [2023-11-29 02:52:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:31,791 INFO L495 AbstractCegarLoop]: Abstraction has 1907 states and 2575 transitions. [2023-11-29 02:52:31,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2575 transitions. [2023-11-29 02:52:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:52:31,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:31,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:31,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-29 02:52:31,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:31,995 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:31,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash -251212221, now seen corresponding path program 1 times [2023-11-29 02:52:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902618197] [2023-11-29 02:52:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:31,996 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 [2023-11-29 02:52:31,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:31,997 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:31,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:32,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:52:32,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:32,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:32,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902618197] [2023-11-29 02:52:32,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902618197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:32,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:32,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:52:32,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352795586] [2023-11-29 02:52:32,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:32,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:52:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:52:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:32,143 INFO L87 Difference]: Start difference. First operand 1907 states and 2575 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:33,182 INFO L93 Difference]: Finished difference Result 1853 states and 2495 transitions. [2023-11-29 02:52:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:52:33,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2023-11-29 02:52:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:33,192 INFO L225 Difference]: With dead ends: 1853 [2023-11-29 02:52:33,192 INFO L226 Difference]: Without dead ends: 1853 [2023-11-29 02:52:33,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:52:33,193 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 70 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:33,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2409 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:52:33,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2023-11-29 02:52:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2023-11-29 02:52:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1138 states have (on average 2.1766256590509667) internal successors, (2477), 1842 states have internal predecessors, (2477), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2495 transitions. [2023-11-29 02:52:33,225 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2495 transitions. Word has length 11 [2023-11-29 02:52:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:33,225 INFO L495 AbstractCegarLoop]: Abstraction has 1853 states and 2495 transitions. [2023-11-29 02:52:33,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2495 transitions. [2023-11-29 02:52:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:52:33,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:33,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:52:33,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:33,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:33,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:33,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -896778947, now seen corresponding path program 1 times [2023-11-29 02:52:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:33,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161597715] [2023-11-29 02:52:33,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:33,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:33,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:33,429 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:33,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:33,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:52:33,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:33,608 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:33,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:33,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161597715] [2023-11-29 02:52:33,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161597715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:33,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:33,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:33,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032629519] [2023-11-29 02:52:33,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:33,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:52:33,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:33,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:52:33,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:33,611 INFO L87 Difference]: Start difference. First operand 1853 states and 2495 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:35,126 INFO L93 Difference]: Finished difference Result 1839 states and 2453 transitions. [2023-11-29 02:52:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:52:35,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 02:52:35,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:35,136 INFO L225 Difference]: With dead ends: 1839 [2023-11-29 02:52:35,136 INFO L226 Difference]: Without dead ends: 1839 [2023-11-29 02:52:35,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:35,136 INFO L413 NwaCegarLoop]: 1198 mSDtfsCounter, 58 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:35,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3570 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:52:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2023-11-29 02:52:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1837. [2023-11-29 02:52:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1136 states have (on average 2.141725352112676) internal successors, (2433), 1826 states have internal predecessors, (2433), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2451 transitions. [2023-11-29 02:52:35,171 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2451 transitions. Word has length 13 [2023-11-29 02:52:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:35,172 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 2451 transitions. [2023-11-29 02:52:35,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2451 transitions. [2023-11-29 02:52:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:52:35,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:35,174 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] [2023-11-29 02:52:35,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 02:52:35,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:35,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:35,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash 80004107, now seen corresponding path program 1 times [2023-11-29 02:52:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841366787] [2023-11-29 02:52:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:35,378 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 [2023-11-29 02:52:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:35,379 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:35,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:35,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:52:35,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:35,559 INFO L378 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 [2023-11-29 02:52:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:35,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:35,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841366787] [2023-11-29 02:52:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841366787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:35,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:52:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227517998] [2023-11-29 02:52:35,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:35,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:52:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:52:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:35,642 INFO L87 Difference]: Start difference. First operand 1837 states and 2451 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:39,331 INFO L93 Difference]: Finished difference Result 1890 states and 2454 transitions. [2023-11-29 02:52:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:52:39,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:52:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:39,341 INFO L225 Difference]: With dead ends: 1890 [2023-11-29 02:52:39,341 INFO L226 Difference]: Without dead ends: 1890 [2023-11-29 02:52:39,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:39,342 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 964 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:39,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1519 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 02:52:39,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2023-11-29 02:52:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1833. [2023-11-29 02:52:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1136 states have (on average 2.1346830985915495) internal successors, (2425), 1822 states have internal predecessors, (2425), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2443 transitions. [2023-11-29 02:52:39,375 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2443 transitions. Word has length 27 [2023-11-29 02:52:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:39,375 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2443 transitions. [2023-11-29 02:52:39,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2443 transitions. [2023-11-29 02:52:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:52:39,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:39,376 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] [2023-11-29 02:52:39,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-29 02:52:39,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:39,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:39,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 80004108, now seen corresponding path program 1 times [2023-11-29 02:52:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731871579] [2023-11-29 02:52:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:39,578 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 [2023-11-29 02:52:39,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:39,579 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:39,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:39,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:52:39,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:39,796 INFO L378 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 [2023-11-29 02:52:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:39,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:39,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731871579] [2023-11-29 02:52:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731871579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:39,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:39,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:52:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748802791] [2023-11-29 02:52:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:39,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:52:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:52:39,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:39,959 INFO L87 Difference]: Start difference. First operand 1833 states and 2443 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:44,903 INFO L93 Difference]: Finished difference Result 1978 states and 2454 transitions. [2023-11-29 02:52:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:52:44,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:52:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:44,911 INFO L225 Difference]: With dead ends: 1978 [2023-11-29 02:52:44,911 INFO L226 Difference]: Without dead ends: 1978 [2023-11-29 02:52:44,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:44,912 INFO L413 NwaCegarLoop]: 1301 mSDtfsCounter, 393 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:44,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 2516 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 02:52:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2023-11-29 02:52:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1829. [2023-11-29 02:52:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1136 states have (on average 2.1276408450704225) internal successors, (2417), 1818 states have internal predecessors, (2417), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2435 transitions. [2023-11-29 02:52:44,946 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2435 transitions. Word has length 27 [2023-11-29 02:52:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:44,946 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 2435 transitions. [2023-11-29 02:52:44,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2435 transitions. [2023-11-29 02:52:44,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:52:44,948 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:44,948 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] [2023-11-29 02:52:44,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:45,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:45,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:45,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 935617745, now seen corresponding path program 1 times [2023-11-29 02:52:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:45,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078310273] [2023-11-29 02:52:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:45,153 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 [2023-11-29 02:52:45,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:45,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:45,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:45,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:52:45,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:45,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:45,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:45,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078310273] [2023-11-29 02:52:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078310273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:45,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:45,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615400718] [2023-11-29 02:52:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:45,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:52:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:52:45,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:45,383 INFO L87 Difference]: Start difference. First operand 1829 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:46,803 INFO L93 Difference]: Finished difference Result 1817 states and 2415 transitions. [2023-11-29 02:52:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:52:46,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-11-29 02:52:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:46,813 INFO L225 Difference]: With dead ends: 1817 [2023-11-29 02:52:46,813 INFO L226 Difference]: Without dead ends: 1817 [2023-11-29 02:52:46,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:46,814 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 23 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3556 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:46,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3556 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:52:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2023-11-29 02:52:46,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1817. [2023-11-29 02:52:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1124 states have (on average 2.132562277580071) internal successors, (2397), 1806 states have internal predecessors, (2397), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2415 transitions. [2023-11-29 02:52:46,836 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2415 transitions. Word has length 46 [2023-11-29 02:52:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:46,837 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 2415 transitions. [2023-11-29 02:52:46,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2415 transitions. [2023-11-29 02:52:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 02:52:46,839 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:46,839 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] [2023-11-29 02:52:46,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 02:52:47,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:47,043 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:47,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 560683185, now seen corresponding path program 1 times [2023-11-29 02:52:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:47,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999623544] [2023-11-29 02:52:47,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:47,044 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 [2023-11-29 02:52:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:47,045 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:47,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:47,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:52:47,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:47,374 INFO L378 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 [2023-11-29 02:52:47,379 INFO L378 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 [2023-11-29 02:52:47,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:52:47,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 02:52:47,829 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:52:47,830 INFO L378 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 [2023-11-29 02:52:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:47,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:47,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:47,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999623544] [2023-11-29 02:52:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999623544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:47,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:47,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:52:47,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652013724] [2023-11-29 02:52:47,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:47,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:52:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:47,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:52:47,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:47,846 INFO L87 Difference]: Start difference. First operand 1817 states and 2415 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:51,649 INFO L93 Difference]: Finished difference Result 1789 states and 2299 transitions. [2023-11-29 02:52:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:52:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2023-11-29 02:52:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:51,656 INFO L225 Difference]: With dead ends: 1789 [2023-11-29 02:52:51,656 INFO L226 Difference]: Without dead ends: 1789 [2023-11-29 02:52:51,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:52:51,657 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 943 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:51,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 860 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 02:52:51,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2023-11-29 02:52:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1600. [2023-11-29 02:52:51,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 991 states have (on average 2.005045408678103) internal successors, (1987), 1589 states have internal predecessors, (1987), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2005 transitions. [2023-11-29 02:52:51,676 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2005 transitions. Word has length 50 [2023-11-29 02:52:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:51,676 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2005 transitions. [2023-11-29 02:52:51,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2005 transitions. [2023-11-29 02:52:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:52:51,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:51,677 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] [2023-11-29 02:52:51,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 02:52:51,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:51,877 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:51,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash -852831317, now seen corresponding path program 1 times [2023-11-29 02:52:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454887459] [2023-11-29 02:52:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:51,879 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 [2023-11-29 02:52:51,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:51,880 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:51,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:52,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:52:52,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:52,147 INFO L378 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 [2023-11-29 02:52:52,163 INFO L378 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 19 treesize of output 1 [2023-11-29 02:52:52,183 INFO L378 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 [2023-11-29 02:52:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:52,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:52,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:52,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454887459] [2023-11-29 02:52:52,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454887459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:52,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:52,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:52,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97166582] [2023-11-29 02:52:52,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:52,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:52,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:52,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:52,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:52,196 INFO L87 Difference]: Start difference. First operand 1600 states and 2005 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:52:56,414 INFO L93 Difference]: Finished difference Result 1599 states and 2003 transitions. [2023-11-29 02:52:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:52:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-11-29 02:52:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:52:56,420 INFO L225 Difference]: With dead ends: 1599 [2023-11-29 02:52:56,420 INFO L226 Difference]: Without dead ends: 1599 [2023-11-29 02:52:56,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:52:56,420 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 3 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:52:56,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2796 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 02:52:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2023-11-29 02:52:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2023-11-29 02:52:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 991 states have (on average 2.003027245206862) internal successors, (1985), 1588 states have internal predecessors, (1985), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:52:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2003 transitions. [2023-11-29 02:52:56,440 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2003 transitions. Word has length 54 [2023-11-29 02:52:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:52:56,440 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2003 transitions. [2023-11-29 02:52:56,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:52:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2003 transitions. [2023-11-29 02:52:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:52:56,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:52:56,442 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] [2023-11-29 02:52:56,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 02:52:56,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:52:56,645 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:52:56,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:52:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -852831316, now seen corresponding path program 1 times [2023-11-29 02:52:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:52:56,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224530984] [2023-11-29 02:52:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:52:56,646 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 [2023-11-29 02:52:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:52:56,646 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:52:56,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:52:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:52:56,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:52:56,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:52:56,881 INFO L378 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 [2023-11-29 02:52:56,898 INFO L378 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 [2023-11-29 02:52:56,909 INFO L378 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 19 treesize of output 1 [2023-11-29 02:52:56,944 INFO L378 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 [2023-11-29 02:52:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:52:56,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:52:56,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:52:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224530984] [2023-11-29 02:52:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224530984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:52:56,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:52:56,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:52:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622047906] [2023-11-29 02:52:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:52:56,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:52:56,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:52:56,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:52:56,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:52:56,965 INFO L87 Difference]: Start difference. First operand 1599 states and 2003 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:02,316 INFO L93 Difference]: Finished difference Result 1598 states and 2001 transitions. [2023-11-29 02:53:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:53:02,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2023-11-29 02:53:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:02,321 INFO L225 Difference]: With dead ends: 1598 [2023-11-29 02:53:02,321 INFO L226 Difference]: Without dead ends: 1598 [2023-11-29 02:53:02,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:53:02,322 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 1 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:02,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2845 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-29 02:53:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2023-11-29 02:53:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2023-11-29 02:53:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 989 states have (on average 2.005055611729019) internal successors, (1983), 1587 states have internal predecessors, (1983), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:53:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2001 transitions. [2023-11-29 02:53:02,339 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2001 transitions. Word has length 54 [2023-11-29 02:53:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:02,339 INFO L495 AbstractCegarLoop]: Abstraction has 1598 states and 2001 transitions. [2023-11-29 02:53:02,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:53:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2001 transitions. [2023-11-29 02:53:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:53:02,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:02,340 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] [2023-11-29 02:53:02,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-29 02:53:02,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:53:02,541 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:53:02,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:02,541 INFO L85 PathProgramCache]: Analyzing trace with hash 980342063, now seen corresponding path program 1 times [2023-11-29 02:53:02,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:02,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144864787] [2023-11-29 02:53:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:02,542 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 [2023-11-29 02:53:02,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:02,542 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:53:02,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:02,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:53:02,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:02,841 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:53:02,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:02,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144864787] [2023-11-29 02:53:02,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144864787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:53:02,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:53:02,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:53:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820416697] [2023-11-29 02:53:02,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:53:02,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:53:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:53:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:53:02,843 INFO L87 Difference]: Start difference. First operand 1598 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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) [2023-11-29 02:53:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:04,214 INFO L93 Difference]: Finished difference Result 1600 states and 2006 transitions. [2023-11-29 02:53:04,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:53:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 60 [2023-11-29 02:53:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:04,222 INFO L225 Difference]: With dead ends: 1600 [2023-11-29 02:53:04,222 INFO L226 Difference]: Without dead ends: 1600 [2023-11-29 02:53:04,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:53:04,223 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 1 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:04,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3351 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:53:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2023-11-29 02:53:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2023-11-29 02:53:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 990 states have (on average 2.005050505050505) internal successors, (1985), 1589 states have internal predecessors, (1985), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:53:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2006 transitions. [2023-11-29 02:53:04,247 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2006 transitions. Word has length 60 [2023-11-29 02:53:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:04,248 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2006 transitions. [2023-11-29 02:53:04,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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) [2023-11-29 02:53:04,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2006 transitions. [2023-11-29 02:53:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 02:53:04,249 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:04,249 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] [2023-11-29 02:53:04,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:04,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:53:04,449 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:53:04,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash -160912010, now seen corresponding path program 1 times [2023-11-29 02:53:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176212073] [2023-11-29 02:53:04,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:53:04,450 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 [2023-11-29 02:53:04,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:04,451 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:53:04,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:53:04,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:53:04,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:04,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:04,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:04,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176212073] [2023-11-29 02:53:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176212073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:53:04,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:53:04,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 02:53:04,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623214333] [2023-11-29 02:53:04,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:53:04,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:53:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:53:04,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:53:04,797 INFO L87 Difference]: Start difference. First operand 1600 states and 2006 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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) [2023-11-29 02:53:06,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:06,376 INFO L93 Difference]: Finished difference Result 1609 states and 2022 transitions. [2023-11-29 02:53:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:53:06,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 61 [2023-11-29 02:53:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:06,382 INFO L225 Difference]: With dead ends: 1609 [2023-11-29 02:53:06,382 INFO L226 Difference]: Without dead ends: 1609 [2023-11-29 02:53:06,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:53:06,383 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 6 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:06,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3347 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:53:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2023-11-29 02:53:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1608. [2023-11-29 02:53:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 997 states have (on average 2.004012036108325) internal successors, (1998), 1596 states have internal predecessors, (1998), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:53:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2019 transitions. [2023-11-29 02:53:06,409 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2019 transitions. Word has length 61 [2023-11-29 02:53:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:06,410 INFO L495 AbstractCegarLoop]: Abstraction has 1608 states and 2019 transitions. [2023-11-29 02:53:06,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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) [2023-11-29 02:53:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2019 transitions. [2023-11-29 02:53:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 02:53:06,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:06,411 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] [2023-11-29 02:53:06,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 02:53:06,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:53:06,611 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:53:06,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1447440111, now seen corresponding path program 2 times [2023-11-29 02:53:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30834664] [2023-11-29 02:53:06,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:53:06,613 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 [2023-11-29 02:53:06,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:06,614 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:53:06,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:07,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:53:07,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:53:07,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:53:07,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:07,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:07,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30834664] [2023-11-29 02:53:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30834664] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:53:07,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:53:07,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 02:53:07,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136163056] [2023-11-29 02:53:07,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:53:07,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:53:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:07,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:53:07,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:53:07,313 INFO L87 Difference]: Start difference. First operand 1608 states and 2019 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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) [2023-11-29 02:53:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:11,671 INFO L93 Difference]: Finished difference Result 1623 states and 2049 transitions. [2023-11-29 02:53:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:53:11,672 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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 64 [2023-11-29 02:53:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:11,675 INFO L225 Difference]: With dead ends: 1623 [2023-11-29 02:53:11,675 INFO L226 Difference]: Without dead ends: 1621 [2023-11-29 02:53:11,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:53:11,676 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 12 mSDsluCounter, 10025 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11142 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:11,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11142 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 02:53:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2023-11-29 02:53:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1617. [2023-11-29 02:53:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1006 states have (on average 1.9980119284294235) internal successors, (2010), 1605 states have internal predecessors, (2010), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:53:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2031 transitions. [2023-11-29 02:53:11,695 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2031 transitions. Word has length 64 [2023-11-29 02:53:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:11,695 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2031 transitions. [2023-11-29 02:53:11,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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) [2023-11-29 02:53:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2031 transitions. [2023-11-29 02:53:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 02:53:11,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:11,696 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] [2023-11-29 02:53:11,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 02:53:11,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:53:11,896 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:53:11,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1829842545, now seen corresponding path program 3 times [2023-11-29 02:53:11,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314374285] [2023-11-29 02:53:11,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:53:11,897 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 [2023-11-29 02:53:11,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:11,898 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:53:11,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:12,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:53:12,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:53:12,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:53:12,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:12,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:13,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314374285] [2023-11-29 02:53:13,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314374285] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:53:13,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:53:13,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 02:53:13,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641668860] [2023-11-29 02:53:13,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:53:13,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 02:53:13,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 02:53:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:53:13,201 INFO L87 Difference]: Start difference. First operand 1617 states and 2031 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 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) [2023-11-29 02:53:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:21,892 INFO L93 Difference]: Finished difference Result 1647 states and 2109 transitions. [2023-11-29 02:53:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:53:21,892 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 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 70 [2023-11-29 02:53:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:21,895 INFO L225 Difference]: With dead ends: 1647 [2023-11-29 02:53:21,896 INFO L226 Difference]: Without dead ends: 1644 [2023-11-29 02:53:21,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 02:53:21,897 INFO L413 NwaCegarLoop]: 1115 mSDtfsCounter, 24 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17796 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:21,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 17796 Invalid, 3378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 3357 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-29 02:53:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2023-11-29 02:53:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1635. [2023-11-29 02:53:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1024 states have (on average 1.9853515625) internal successors, (2033), 1623 states have internal predecessors, (2033), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:53:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2054 transitions. [2023-11-29 02:53:21,921 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2054 transitions. Word has length 70 [2023-11-29 02:53:21,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:21,921 INFO L495 AbstractCegarLoop]: Abstraction has 1635 states and 2054 transitions. [2023-11-29 02:53:21,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 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) [2023-11-29 02:53:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2054 transitions. [2023-11-29 02:53:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 02:53:21,922 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:21,923 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] [2023-11-29 02:53:21,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:22,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:53:22,123 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:53:22,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash -274420017, now seen corresponding path program 4 times [2023-11-29 02:53:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747270603] [2023-11-29 02:53:22,124 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:53:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:53:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:22,125 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:53:22,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:22,503 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:53:22,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:53:22,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:53:22,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:22,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:53:24,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:24,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747270603] [2023-11-29 02:53:24,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747270603] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:53:24,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:53:24,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 02:53:24,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512040784] [2023-11-29 02:53:24,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:53:24,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 02:53:24,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:53:24,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 02:53:24,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:53:24,319 INFO L87 Difference]: Start difference. First operand 1635 states and 2054 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 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) [2023-11-29 02:53:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:53:42,113 INFO L93 Difference]: Finished difference Result 1692 states and 2185 transitions. [2023-11-29 02:53:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 02:53:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 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 82 [2023-11-29 02:53:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:53:42,118 INFO L225 Difference]: With dead ends: 1692 [2023-11-29 02:53:42,118 INFO L226 Difference]: Without dead ends: 1690 [2023-11-29 02:53:42,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 02:53:42,122 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 48 mSDsluCounter, 26758 mSDsCounter, 0 mSdLazyCounter, 6643 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 27875 SdHoareTripleChecker+Invalid, 6786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 6643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:53:42,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 27875 Invalid, 6786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [143 Valid, 6643 Invalid, 0 Unknown, 0 Unchecked, 13.0s Time] [2023-11-29 02:53:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2023-11-29 02:53:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1669. [2023-11-29 02:53:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1058 states have (on average 1.9650283553875236) internal successors, (2079), 1657 states have internal predecessors, (2079), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:53:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2023-11-29 02:53:42,151 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 82 [2023-11-29 02:53:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:53:42,151 INFO L495 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2023-11-29 02:53:42,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 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) [2023-11-29 02:53:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2023-11-29 02:53:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:53:42,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:53:42,153 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] [2023-11-29 02:53:42,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:42,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:53:42,357 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:53:42,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:53:42,357 INFO L85 PathProgramCache]: Analyzing trace with hash 151097455, now seen corresponding path program 5 times [2023-11-29 02:53:42,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:53:42,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488290281] [2023-11-29 02:53:42,358 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:53:42,358 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 [2023-11-29 02:53:42,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:53:42,359 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:53:42,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 02:53:43,785 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:53:43,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:53:43,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 02:53:43,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:53:43,842 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:53:43,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 02:53:44,215 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:53:44,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 02:53:44,301 INFO L378 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 19 treesize of output 1 [2023-11-29 02:53:44,460 INFO L378 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 42 treesize of output 24 [2023-11-29 02:53:46,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:53:46,932 INFO L378 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 62 treesize of output 59 [2023-11-29 02:53:47,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2023-11-29 02:53:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:53:47,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:53:47,502 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1592) |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 [2023-11-29 02:53:47,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:53:47,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488290281] [2023-11-29 02:53:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488290281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:53:47,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1200241725] [2023-11-29 02:53:47,505 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:53:47,505 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:53:47,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:53:47,506 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:53:47,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-11-29 02:54:50,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:54:50,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:54:51,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:54:51,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:54:51,164 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:54:51,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:54:51,579 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:54:51,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:54:51,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:54:52,187 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:54:52,187 INFO L378 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 44 treesize of output 41 [2023-11-29 02:54:52,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:54:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:54:52,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:54:52,668 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 02:54:52,668 INFO L378 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 25 treesize of output 24 [2023-11-29 02:54:52,675 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 02:54:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1200241725] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:54:52,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:54:52,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2023-11-29 02:54:52,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133599848] [2023-11-29 02:54:52,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:54:52,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:54:52,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:54:52,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:54:52,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=410, Unknown=2, NotChecked=82, Total=552 [2023-11-29 02:54:52,679 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:55:22,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:55:22,618 INFO L93 Difference]: Finished difference Result 2979 states and 3454 transitions. [2023-11-29 02:55:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 02:55:22,618 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2023-11-29 02:55:22,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:55:22,623 INFO L225 Difference]: With dead ends: 2979 [2023-11-29 02:55:22,623 INFO L226 Difference]: Without dead ends: 2975 [2023-11-29 02:55:22,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=1627, Unknown=2, NotChecked=170, Total=2070 [2023-11-29 02:55:22,625 INFO L413 NwaCegarLoop]: 837 mSDtfsCounter, 4737 mSDsluCounter, 11843 mSDsCounter, 0 mSdLazyCounter, 16910 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 17045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 16910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:55:22,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12680 Invalid, 17045 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [135 Valid, 16910 Invalid, 0 Unknown, 0 Unchecked, 28.9s Time] [2023-11-29 02:55:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2023-11-29 02:55:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2118. [2023-11-29 02:55:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 1502 states have (on average 1.8521970705725699) internal successors, (2782), 2098 states have internal predecessors, (2782), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:55:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 2817 transitions. [2023-11-29 02:55:22,660 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 2817 transitions. Word has length 104 [2023-11-29 02:55:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:55:22,661 INFO L495 AbstractCegarLoop]: Abstraction has 2118 states and 2817 transitions. [2023-11-29 02:55:22,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:55:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2817 transitions. [2023-11-29 02:55:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:55:22,662 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:55:22,662 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] [2023-11-29 02:55:22,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-11-29 02:55:22,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 02:55:23,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:55:23,063 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:55:23,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:55:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash 151097456, now seen corresponding path program 1 times [2023-11-29 02:55:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:55:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374399497] [2023-11-29 02:55:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:55:23,064 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 [2023-11-29 02:55:23,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:55:23,065 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:55:23,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 02:55:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:55:23,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 02:55:23,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:55:23,780 INFO L378 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 [2023-11-29 02:55:24,010 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:55:24,011 INFO L378 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 [2023-11-29 02:55:24,017 INFO L378 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 [2023-11-29 02:55:24,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:55:24,069 INFO L378 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 15 treesize of output 1 [2023-11-29 02:55:24,163 INFO L378 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 18 treesize of output 10 [2023-11-29 02:55:24,167 INFO L378 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 7 treesize of output 3 [2023-11-29 02:55:24,781 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:55:24,781 INFO L378 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 50 treesize of output 45 [2023-11-29 02:55:24,790 INFO L378 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 24 treesize of output 11 [2023-11-29 02:55:24,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:55:24,834 INFO L378 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 7 treesize of output 3 [2023-11-29 02:55:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:55:24,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:55:26,148 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2573 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 02:55:26,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:55:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374399497] [2023-11-29 02:55:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374399497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:55:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [61036188] [2023-11-29 02:55:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:55:26,155 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:55:26,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:55:26,156 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:55:26,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 02:57:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:57:07,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 02:57:07,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:57:07,621 INFO L378 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 [2023-11-29 02:57:07,848 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:57:07,849 INFO L378 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 [2023-11-29 02:57:07,854 INFO L378 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 [2023-11-29 02:57:07,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:57:07,885 INFO L378 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 15 treesize of output 1 [2023-11-29 02:57:07,936 INFO L378 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 18 treesize of output 10 [2023-11-29 02:57:07,940 INFO L378 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 7 treesize of output 3 [2023-11-29 02:57:08,506 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:57:08,507 INFO L378 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 50 treesize of output 45 [2023-11-29 02:57:08,516 INFO L378 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 24 treesize of output 11 [2023-11-29 02:57:08,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:57:08,558 INFO L378 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 7 treesize of output 3 [2023-11-29 02:57:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:57:08,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:57:09,837 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:57:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [61036188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:57:09,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:57:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 02:57:09,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026871233] [2023-11-29 02:57:09,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:57:09,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:57:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:57:09,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:57:09,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 02:57:09,844 INFO L87 Difference]: Start difference. First operand 2118 states and 2817 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 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) [2023-11-29 02:57:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:57:21,358 INFO L93 Difference]: Finished difference Result 2461 states and 3126 transitions. [2023-11-29 02:57:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:57:21,359 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 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 104 [2023-11-29 02:57:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:57:21,363 INFO L225 Difference]: With dead ends: 2461 [2023-11-29 02:57:21,363 INFO L226 Difference]: Without dead ends: 2461 [2023-11-29 02:57:21,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 02:57:21,363 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 706 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 5059 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:57:21,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 3335 Invalid, 5070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5059 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2023-11-29 02:57:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2023-11-29 02:57:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2117. [2023-11-29 02:57:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1502 states have (on average 1.8501997336884155) internal successors, (2779), 2097 states have internal predecessors, (2779), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:57:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2814 transitions. [2023-11-29 02:57:21,388 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2814 transitions. Word has length 104 [2023-11-29 02:57:21,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:57:21,388 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 2814 transitions. [2023-11-29 02:57:21,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 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) [2023-11-29 02:57:21,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2814 transitions. [2023-11-29 02:57:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 02:57:21,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:57:21,389 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] [2023-11-29 02:57:21,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 02:57:21,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-11-29 02:57:21,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:57:21,790 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:57:21,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:57:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash -822164495, now seen corresponding path program 1 times [2023-11-29 02:57:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:57:21,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440928212] [2023-11-29 02:57:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:57:21,791 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 [2023-11-29 02:57:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:57:21,791 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:57:21,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 02:57:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:57:22,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 02:57:22,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:57:22,727 INFO L378 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 [2023-11-29 02:57:22,868 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:57:22,868 INFO L378 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 [2023-11-29 02:57:22,905 INFO L378 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 19 treesize of output 1 [2023-11-29 02:57:22,988 INFO L378 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 [2023-11-29 02:57:23,808 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:57:23,808 INFO L378 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 44 treesize of output 43 [2023-11-29 02:57:23,904 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:57:23,905 INFO L378 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 44 treesize of output 43 [2023-11-29 02:57:23,916 INFO L378 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 [2023-11-29 02:57:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:57:23,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:57:23,993 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3516) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-11-29 02:57:28,455 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3516)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:57:28,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:57:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440928212] [2023-11-29 02:57:28,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440928212] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:57:28,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1163982484] [2023-11-29 02:57:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:57:28,459 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:57:28,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:57:28,459 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:57:28,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-29 02:57:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:57:30,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 02:57:30,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:57:30,809 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:57:30,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:57:31,241 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:57:31,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:57:31,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:57:31,994 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:57:31,995 INFO L378 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 44 treesize of output 41 [2023-11-29 02:57:32,162 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:57:32,163 INFO L378 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 44 treesize of output 41 [2023-11-29 02:57:32,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:57:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:57:32,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:57:36,353 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3967) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:57:36,748 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 02:57:36,749 INFO L378 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 37 treesize of output 36 [2023-11-29 02:57:36,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4013))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3967)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:57:36,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1163982484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:57:36,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:57:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2023-11-29 02:57:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437825972] [2023-11-29 02:57:36,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:57:36,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:57:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:57:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:57:36,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=521, Unknown=10, NotChecked=196, Total=812 [2023-11-29 02:57:36,763 INFO L87 Difference]: Start difference. First operand 2117 states and 2814 transitions. Second operand has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:58:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:58:10,448 INFO L93 Difference]: Finished difference Result 2971 states and 3440 transitions. [2023-11-29 02:58:10,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:58:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 02:58:10,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:58:10,453 INFO L225 Difference]: With dead ends: 2971 [2023-11-29 02:58:10,453 INFO L226 Difference]: Without dead ends: 2971 [2023-11-29 02:58:10,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=211, Invalid=1277, Unknown=10, NotChecked=308, Total=1806 [2023-11-29 02:58:10,454 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 1882 mSDsluCounter, 12005 mSDsCounter, 0 mSdLazyCounter, 16036 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 13013 SdHoareTripleChecker+Invalid, 16077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 16036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:58:10,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 13013 Invalid, 16077 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 16036 Invalid, 0 Unknown, 0 Unchecked, 32.7s Time] [2023-11-29 02:58:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2023-11-29 02:58:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2116. [2023-11-29 02:58:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1502 states have (on average 1.848202396804261) internal successors, (2776), 2096 states have internal predecessors, (2776), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:58:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2811 transitions. [2023-11-29 02:58:10,477 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2811 transitions. Word has length 106 [2023-11-29 02:58:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:58:10,478 INFO L495 AbstractCegarLoop]: Abstraction has 2116 states and 2811 transitions. [2023-11-29 02:58:10,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:58:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2811 transitions. [2023-11-29 02:58:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 02:58:10,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:58:10,479 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] [2023-11-29 02:58:10,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-11-29 02:58:10,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-11-29 02:58:10,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:58:10,879 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:58:10,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:58:10,880 INFO L85 PathProgramCache]: Analyzing trace with hash -822164494, now seen corresponding path program 1 times [2023-11-29 02:58:10,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:58:10,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243440051] [2023-11-29 02:58:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:58:10,881 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 [2023-11-29 02:58:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:58:10,881 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 02:58:10,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 02:58:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:58:11,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 02:58:11,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:58:11,783 INFO L378 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 [2023-11-29 02:58:11,913 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:58:11,913 INFO L378 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 [2023-11-29 02:58:11,923 INFO L378 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 [2023-11-29 02:58:11,950 INFO L378 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 19 treesize of output 1 [2023-11-29 02:58:11,959 INFO L378 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 [2023-11-29 02:58:12,079 INFO L378 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 [2023-11-29 02:58:12,084 INFO L378 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 [2023-11-29 02:58:12,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:58:12,822 INFO L378 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 62 treesize of output 57 [2023-11-29 02:58:12,833 INFO L378 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 30 treesize of output 13 [2023-11-29 02:58:12,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:58:12,955 INFO L378 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 62 treesize of output 57 [2023-11-29 02:58:12,969 INFO L378 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 30 treesize of output 13 [2023-11-29 02:58:12,984 INFO L378 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 [2023-11-29 02:58:12,991 INFO L378 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 [2023-11-29 02:58:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:58:13,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:58:13,189 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:58:13,227 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 02:58:14,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4557))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4558) .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4558) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4557) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 02:58:14,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:58:14,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243440051] [2023-11-29 02:58:14,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243440051] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:58:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [169840348] [2023-11-29 02:58:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:58:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:58:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:58:14,579 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:58:14,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-11-29 03:00:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:01,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 03:00:01,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:01,423 INFO L378 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 [2023-11-29 03:00:01,700 INFO L378 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 [2023-11-29 03:00:01,718 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:00:01,719 INFO L378 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 [2023-11-29 03:00:01,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:00:01,787 INFO L378 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 15 treesize of output 1 [2023-11-29 03:00:01,931 INFO L378 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 18 treesize of output 10 [2023-11-29 03:00:01,935 INFO L378 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 7 treesize of output 3 [2023-11-29 03:00:02,584 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:02,584 INFO L378 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 50 treesize of output 45 [2023-11-29 03:00:02,591 INFO L378 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 24 treesize of output 11 [2023-11-29 03:00:02,823 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:00:02,823 INFO L378 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 50 treesize of output 45 [2023-11-29 03:00:02,835 INFO L378 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 24 treesize of output 11 [2023-11-29 03:00:02,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:00:02,859 INFO L378 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 7 treesize of output 3 [2023-11-29 03:00:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:00:02,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:02,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 03:00:02,960 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 03:00:04,501 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5103) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5102) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5102))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5103) .cse2 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:00:04,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [169840348] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:04,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:00:04,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 03:00:04,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080877880] [2023-11-29 03:00:04,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:00:04,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 03:00:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:00:04,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 03:00:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 03:00:04,513 INFO L87 Difference]: Start difference. First operand 2116 states and 2811 transitions. Second operand has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:00:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:00:34,289 INFO L93 Difference]: Finished difference Result 2469 states and 3131 transitions. [2023-11-29 03:00:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:00:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 03:00:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:00:34,295 INFO L225 Difference]: With dead ends: 2469 [2023-11-29 03:00:34,295 INFO L226 Difference]: Without dead ends: 2469 [2023-11-29 03:00:34,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 03:00:34,296 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 1109 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 11196 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 5248 SdHoareTripleChecker+Invalid, 11215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:00:34,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 5248 Invalid, 11215 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 11196 Invalid, 0 Unknown, 0 Unchecked, 29.3s Time] [2023-11-29 03:00:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2023-11-29 03:00:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2115. [2023-11-29 03:00:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 1502 states have (on average 1.8462050599201065) internal successors, (2773), 2095 states have internal predecessors, (2773), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 03:00:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2808 transitions. [2023-11-29 03:00:34,328 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2808 transitions. Word has length 106 [2023-11-29 03:00:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:00:34,329 INFO L495 AbstractCegarLoop]: Abstraction has 2115 states and 2808 transitions. [2023-11-29 03:00:34,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:00:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2808 transitions. [2023-11-29 03:00:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:00:34,330 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:00:34,330 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] [2023-11-29 03:00:34,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-11-29 03:00:34,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-11-29 03:00:34,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:00:34,731 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 03:00:34,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:00:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 175966541, now seen corresponding path program 1 times [2023-11-29 03:00:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:00:34,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289998467] [2023-11-29 03:00:34,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:34,733 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 [2023-11-29 03:00:34,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:00:34,735 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:00:34,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 03:00:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:00:35,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 03:00:35,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:00:35,926 INFO L378 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 [2023-11-29 03:00:36,134 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:00:36,134 INFO L378 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 [2023-11-29 03:00:36,187 INFO L378 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 19 treesize of output 1 [2023-11-29 03:00:36,305 INFO L378 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 [2023-11-29 03:00:37,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:37,488 INFO L378 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 44 treesize of output 43 [2023-11-29 03:00:37,648 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:37,649 INFO L378 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 44 treesize of output 43 [2023-11-29 03:00:37,774 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:00:37,774 INFO L378 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 44 treesize of output 43 [2023-11-29 03:00:37,801 INFO L378 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 [2023-11-29 03:00:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:00:37,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:00:37,966 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5525) |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 [2023-11-29 03:00:37,983 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:00:38,006 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5524))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:00:39,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5571 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5524)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:00:39,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:00:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289998467] [2023-11-29 03:00:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289998467] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:00:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [596253628] [2023-11-29 03:00:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:00:39,931 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:00:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:00:39,932 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:00:39,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-11-29 03:01:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:01:14,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 03:01:14,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:01:14,236 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:01:14,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:01:14,875 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 03:01:14,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:01:14,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:01:15,898 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:15,899 INFO L378 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 44 treesize of output 41 [2023-11-29 03:01:16,169 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:16,169 INFO L378 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 44 treesize of output 41 [2023-11-29 03:01:16,329 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:01:16,330 INFO L378 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 44 treesize of output 41 [2023-11-29 03:01:16,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 03:01:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:01:16,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:01:16,449 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5992) |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 [2023-11-29 03:01:16,466 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:01:16,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5991))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:01:16,505 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5991))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:01:17,074 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 03:01:17,075 INFO L378 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 61 treesize of output 60 [2023-11-29 03:01:17,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6038))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5991)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 03:01:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [596253628] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:01:17,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:01:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2023-11-29 03:01:17,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864777202] [2023-11-29 03:01:17,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:01:17,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:01:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:01:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:01:17,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=573, Unknown=10, NotChecked=504, Total=1190 [2023-11-29 03:01:17,099 INFO L87 Difference]: Start difference. First operand 2115 states and 2808 transitions. Second operand has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:02:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:03,255 INFO L93 Difference]: Finished difference Result 2967 states and 3434 transitions. [2023-11-29 03:02:03,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:02:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 03:02:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:03,260 INFO L225 Difference]: With dead ends: 2967 [2023-11-29 03:02:03,261 INFO L226 Difference]: Without dead ends: 2967 [2023-11-29 03:02:03,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=242, Invalid=1424, Unknown=10, NotChecked=774, Total=2450 [2023-11-29 03:02:03,262 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 1882 mSDsluCounter, 11856 mSDsCounter, 0 mSdLazyCounter, 15836 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 12863 SdHoareTripleChecker+Invalid, 15879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 15836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:03,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 12863 Invalid, 15879 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [43 Valid, 15836 Invalid, 0 Unknown, 0 Unchecked, 44.8s Time] [2023-11-29 03:02:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2023-11-29 03:02:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2114. [2023-11-29 03:02:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1502 states have (on average 1.8442077230359522) internal successors, (2770), 2094 states have internal predecessors, (2770), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 03:02:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2805 transitions. [2023-11-29 03:02:03,304 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2805 transitions. Word has length 108 [2023-11-29 03:02:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:03,304 INFO L495 AbstractCegarLoop]: Abstraction has 2114 states and 2805 transitions. [2023-11-29 03:02:03,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:02:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2805 transitions. [2023-11-29 03:02:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 03:02:03,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:03,306 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] [2023-11-29 03:02:03,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-11-29 03:02:03,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-11-29 03:02:03,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:02:03,707 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 03:02:03,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash 175966542, now seen corresponding path program 1 times [2023-11-29 03:02:03,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:02:03,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117928843] [2023-11-29 03:02:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:03,708 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 [2023-11-29 03:02:03,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:02:03,709 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:02:03,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 03:02:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:04,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 03:02:04,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:02:04,811 INFO L378 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 [2023-11-29 03:02:04,948 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:02:04,948 INFO L378 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 [2023-11-29 03:02:04,959 INFO L378 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 [2023-11-29 03:02:04,988 INFO L378 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 19 treesize of output 1 [2023-11-29 03:02:04,993 INFO L378 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 [2023-11-29 03:02:05,111 INFO L378 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 [2023-11-29 03:02:05,116 INFO L378 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 [2023-11-29 03:02:05,859 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:02:05,860 INFO L378 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 62 treesize of output 57 [2023-11-29 03:02:05,875 INFO L378 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 30 treesize of output 13 [2023-11-29 03:02:05,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:02:05,991 INFO L378 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 62 treesize of output 57 [2023-11-29 03:02:06,006 INFO L378 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 30 treesize of output 13 [2023-11-29 03:02:06,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:02:06,116 INFO L378 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 62 treesize of output 57 [2023-11-29 03:02:06,121 INFO L378 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 30 treesize of output 13 [2023-11-29 03:02:06,143 INFO L378 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 [2023-11-29 03:02:06,151 INFO L378 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 [2023-11-29 03:02:06,188 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:02:06,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:02:06,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 03:02:06,389 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 03:02:06,436 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6506) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6505))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6506) .cse2 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 03:02:06,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6506) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6505))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6506) .cse3 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:02:08,236 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6600))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6505))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6599) .cse0 v_ArrVal_6506) .cse1 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6600))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6599) .cse6 v_ArrVal_6506) (select (select (store .cse7 .cse6 v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6507))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 03:02:08,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:02:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117928843] [2023-11-29 03:02:08,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117928843] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:02:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233017509] [2023-11-29 03:02:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:08,254 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:02:08,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:02:08,255 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:02:08,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-11-29 03:02:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:45,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 03:02:45,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:02:45,307 INFO L378 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 [2023-11-29 03:02:45,640 INFO L378 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 [2023-11-29 03:02:45,661 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:02:45,661 INFO L378 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 [2023-11-29 03:02:45,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:02:45,748 INFO L378 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 15 treesize of output 1 [2023-11-29 03:02:45,979 INFO L378 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 18 treesize of output 10 [2023-11-29 03:02:45,984 INFO L378 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 7 treesize of output 3 [2023-11-29 03:02:46,769 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:46,769 INFO L378 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 50 treesize of output 45 [2023-11-29 03:02:46,780 INFO L378 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 24 treesize of output 11 [2023-11-29 03:02:46,989 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:46,990 INFO L378 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 50 treesize of output 45 [2023-11-29 03:02:47,001 INFO L378 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 24 treesize of output 11 [2023-11-29 03:02:47,141 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:02:47,142 INFO L378 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 50 treesize of output 45 [2023-11-29 03:02:47,153 INFO L378 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 24 treesize of output 11 [2023-11-29 03:02:47,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:02:47,177 INFO L378 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 7 treesize of output 3 [2023-11-29 03:02:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:02:47,186 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:02:47,249 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2023-11-29 03:02:47,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-11-29 03:02:47,521 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7067))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7068) .cse0 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7068) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 03:02:47,668 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7068) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7067))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7068) .cse3 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:02:50,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7161))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7162) .cse1 v_ArrVal_7068) (select (select (store .cse2 .cse1 v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7070))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7161))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7067))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7162) .cse4 v_ArrVal_7068) .cse5 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:02:50,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [233017509] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:02:50,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:02:50,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 03:02:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944565322] [2023-11-29 03:02:50,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:02:50,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 03:02:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:02:50,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 03:02:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 03:02:50,317 INFO L87 Difference]: Start difference. First operand 2114 states and 2805 transitions. Second operand has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:03:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:22,541 INFO L93 Difference]: Finished difference Result 2467 states and 3125 transitions. [2023-11-29 03:03:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:03:22,542 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 03:03:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:22,546 INFO L225 Difference]: With dead ends: 2467 [2023-11-29 03:03:22,546 INFO L226 Difference]: Without dead ends: 2467 [2023-11-29 03:03:22,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 03:03:22,547 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 1586 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 7740 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 7768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:22,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 3643 Invalid, 7768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 7740 Invalid, 0 Unknown, 0 Unchecked, 31.5s Time] [2023-11-29 03:03:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2023-11-29 03:03:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2113. [2023-11-29 03:03:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1502 states have (on average 1.8422103861517976) internal successors, (2767), 2093 states have internal predecessors, (2767), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 03:03:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2802 transitions. [2023-11-29 03:03:22,574 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2802 transitions. Word has length 108 [2023-11-29 03:03:22,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:22,575 INFO L495 AbstractCegarLoop]: Abstraction has 2113 states and 2802 transitions. [2023-11-29 03:03:22,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:03:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2802 transitions. [2023-11-29 03:03:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:03:22,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:22,576 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] [2023-11-29 03:03:22,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-11-29 03:03:22,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-11-29 03:03:22,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:03:22,977 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 03:03:22,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1602180548, now seen corresponding path program 1 times [2023-11-29 03:03:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:03:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18019223] [2023-11-29 03:03:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:03:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:03:22,979 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:03:22,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-11-29 03:03:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:24,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 03:03:24,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:24,539 INFO L378 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 [2023-11-29 03:03:24,808 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:03:24,808 INFO L378 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 [2023-11-29 03:03:24,873 INFO L378 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 19 treesize of output 1 [2023-11-29 03:03:25,062 INFO L378 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 [2023-11-29 03:03:26,655 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:03:26,655 INFO L378 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 44 treesize of output 43 [2023-11-29 03:03:26,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:03:26,863 INFO L378 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 44 treesize of output 43 [2023-11-29 03:03:27,043 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:03:27,043 INFO L378 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 44 treesize of output 43 [2023-11-29 03:03:27,219 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:03:27,219 INFO L378 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 44 treesize of output 43 [2023-11-29 03:03:27,242 INFO L378 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 [2023-11-29 03:03:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:03:27,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:03:31,570 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7600) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:03:31,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:03:31,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:03:31,652 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:03:31,684 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:03:32,295 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7646))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7598)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:03:32,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:03:32,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18019223] [2023-11-29 03:03:32,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18019223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:03:32,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [806874599] [2023-11-29 03:03:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:32,303 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:03:32,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:03:32,304 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:03:32,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-11-29 03:04:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:04:18,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 03:04:18,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:04:18,915 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 03:04:18,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 03:04:19,758 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 03:04:19,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 03:04:19,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:04:21,080 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:04:21,081 INFO L378 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 44 treesize of output 41 [2023-11-29 03:04:21,408 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:04:21,408 INFO L378 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 44 treesize of output 41 [2023-11-29 03:04:21,614 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:04:21,614 INFO L378 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 44 treesize of output 41 [2023-11-29 03:04:21,809 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:04:21,809 INFO L378 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 44 treesize of output 41 [2023-11-29 03:04:21,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 03:04:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:04:21,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:04:21,971 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8083) |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 [2023-11-29 03:04:21,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8083) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 03:04:22,014 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:04:22,038 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 03:04:22,064 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8081))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:04:22,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8081))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 03:04:22,745 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 03:04:22,746 INFO L378 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 109 treesize of output 108 [2023-11-29 03:04:22,769 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8129))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8081)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 03:04:22,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [806874599] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:04:22,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:04:22,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2023-11-29 03:04:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303095934] [2023-11-29 03:04:22,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:04:22,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 03:04:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:04:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 03:04:22,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=677, Unknown=15, NotChecked=832, Total=1640 [2023-11-29 03:04:22,777 INFO L87 Difference]: Start difference. First operand 2113 states and 2802 transitions. Second operand has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:05:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:05:25,745 INFO L93 Difference]: Finished difference Result 2963 states and 3428 transitions. [2023-11-29 03:05:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 03:05:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 03:05:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:05:25,752 INFO L225 Difference]: With dead ends: 2963 [2023-11-29 03:05:25,752 INFO L226 Difference]: Without dead ends: 2963 [2023-11-29 03:05:25,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=263, Invalid=1666, Unknown=15, NotChecked=1248, Total=3192 [2023-11-29 03:05:25,753 INFO L413 NwaCegarLoop]: 1006 mSDtfsCounter, 1870 mSDsluCounter, 13587 mSDsCounter, 0 mSdLazyCounter, 18278 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 14593 SdHoareTripleChecker+Invalid, 18319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:05:25,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 14593 Invalid, 18319 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [41 Valid, 18278 Invalid, 0 Unknown, 0 Unchecked, 61.1s Time] [2023-11-29 03:05:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2023-11-29 03:05:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2112. [2023-11-29 03:05:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1502 states have (on average 1.8402130492676432) internal successors, (2764), 2092 states have internal predecessors, (2764), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 03:05:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2799 transitions. [2023-11-29 03:05:25,778 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2799 transitions. Word has length 110 [2023-11-29 03:05:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:05:25,779 INFO L495 AbstractCegarLoop]: Abstraction has 2112 states and 2799 transitions. [2023-11-29 03:05:25,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 03:05:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2799 transitions. [2023-11-29 03:05:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 03:05:25,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:05:25,780 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] [2023-11-29 03:05:25,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-11-29 03:05:26,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-11-29 03:05:26,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 03:05:26,181 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 03:05:26,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:05:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1602180549, now seen corresponding path program 1 times [2023-11-29 03:05:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:05:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130374196] [2023-11-29 03:05:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:26,182 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 [2023-11-29 03:05:26,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:05:26,183 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:05:26,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-11-29 03:05:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:05:27,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 03:05:27,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:05:27,808 INFO L378 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 [2023-11-29 03:05:28,238 INFO L378 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 [2023-11-29 03:05:28,271 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:05:28,272 INFO L378 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 [2023-11-29 03:05:28,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:05:28,344 INFO L378 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 15 treesize of output 1 [2023-11-29 03:05:28,532 INFO L378 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 18 treesize of output 10 [2023-11-29 03:05:28,539 INFO L378 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 7 treesize of output 3 [2023-11-29 03:05:29,680 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:29,681 INFO L378 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 50 treesize of output 45 [2023-11-29 03:05:29,693 INFO L378 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 24 treesize of output 11 [2023-11-29 03:05:29,909 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:29,909 INFO L378 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 50 treesize of output 45 [2023-11-29 03:05:29,922 INFO L378 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 24 treesize of output 11 [2023-11-29 03:05:30,070 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:30,070 INFO L378 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 50 treesize of output 45 [2023-11-29 03:05:30,088 INFO L378 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 24 treesize of output 11 [2023-11-29 03:05:30,242 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:05:30,242 INFO L378 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 50 treesize of output 45 [2023-11-29 03:05:30,256 INFO L378 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 24 treesize of output 11 [2023-11-29 03:05:30,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:05:30,298 INFO L378 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 7 treesize of output 3 [2023-11-29 03:05:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:05:30,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:05:30,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 03:05:30,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 03:05:30,739 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8613))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8614) .cse0 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8614) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 03:05:30,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8614) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8613))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8614) .cse3 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:05:32,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8611))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8612) .cse1 v_ArrVal_8614) (select (select (store .cse2 .cse1 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8615))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8611))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8613))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8612) .cse4 v_ArrVal_8614) .cse5 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 03:05:34,860 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8611))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8612) .cse2 v_ArrVal_8614) (select (select (store .cse3 .cse2 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8615))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8611))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_8613))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8612) .cse5 v_ArrVal_8614) .cse6 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 03:05:41,381 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8707))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8611))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8613))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8708) .cse0 v_ArrVal_8612) .cse1 v_ArrVal_8614) .cse2 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8707))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8611))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8708) .cse8 v_ArrVal_8612) .cse9 v_ArrVal_8614) (select (select (store .cse10 .cse9 v_ArrVal_8613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8615))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 03:05:41,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:05:41,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130374196] [2023-11-29 03:05:41,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130374196] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:05:41,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1498322108] [2023-11-29 03:05:41,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:05:41,418 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:05:41,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:05:41,419 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:05:41,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8697d184-eabd-4caf-a49f-0f99571f755c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-11-29 03:06:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:06:23,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 03:06:23,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:06:23,230 INFO L378 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 [2023-11-29 03:06:25,005 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:06:25,005 INFO L378 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 [2023-11-29 03:06:25,083 INFO L378 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 [2023-11-29 03:06:25,193 INFO L378 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 15 treesize of output 1 [2023-11-29 03:06:25,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:06:25,543 INFO L378 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 18 treesize of output 10 [2023-11-29 03:06:25,564 INFO L378 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 7 treesize of output 3 [2023-11-29 03:06:29,289 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:06:29,289 INFO L378 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 50 treesize of output 45 [2023-11-29 03:06:29,346 INFO L378 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 24 treesize of output 11 [2023-11-29 03:06:29,742 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:06:29,742 INFO L378 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 50 treesize of output 45 [2023-11-29 03:06:29,779 INFO L378 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 24 treesize of output 11 [2023-11-29 03:06:30,042 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:06:30,043 INFO L378 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 50 treesize of output 45 [2023-11-29 03:06:30,083 INFO L378 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 24 treesize of output 11 [2023-11-29 03:06:30,373 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:06:30,373 INFO L378 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 50 treesize of output 45 [2023-11-29 03:06:30,413 INFO L378 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 24 treesize of output 11 [2023-11-29 03:06:30,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:06:30,513 INFO L378 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 7 treesize of output 3 [2023-11-29 03:06:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 03:06:30,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:06:30,719 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 03:06:30,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 03:06:30,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9193))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9192) .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9192) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 03:06:31,203 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9192) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9193))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9192) .cse3 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 03:06:31,519 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9190))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9193))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9191) .cse0 v_ArrVal_9192) .cse1 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9190))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9191) .cse6 v_ArrVal_9192) (select (select (store .cse7 .cse6 v_ArrVal_9193) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9194))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false