./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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_866d9bdc-3da8-45f8-9b96-783a39017597/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 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:30:44,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:30:44,681 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:30:44,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:30:44,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:30:44,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:30:44,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:30:44,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:30:44,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:30:44,707 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:30:44,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:30:44,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:30:44,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:30:44,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:30:44,710 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:30:44,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:30:44,711 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:30:44,711 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:30:44,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:30:44,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:30:44,713 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:30:44,714 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:30:44,714 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:30:44,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:30:44,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:30:44,715 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:30:44,716 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:30:44,716 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:30:44,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:30:44,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:30:44,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:30:44,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:30:44,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:30:44,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:30:44,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:30:44,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:30:44,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:30:44,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:30:44,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:30:44,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:30:44,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:30:44,728 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_866d9bdc-3da8-45f8-9b96-783a39017597/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_866d9bdc-3da8-45f8-9b96-783a39017597/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 -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2023-11-29 05:30:44,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:30:44,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:30:44,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:30:44,976 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:30:44,976 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:30:44,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2023-11-29 05:30:47,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:30:47,983 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:30:47,983 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2023-11-29 05:30:48,001 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data/3e96740d3/5c46bd8047f3422a922c8634afae1d80/FLAG05b3862d2 [2023-11-29 05:30:48,016 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data/3e96740d3/5c46bd8047f3422a922c8634afae1d80 [2023-11-29 05:30:48,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:30:48,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:30:48,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:30:48,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:30:48,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:30:48,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:30:48" (1/1) ... [2023-11-29 05:30:48,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41abc3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:48, skipping insertion in model container [2023-11-29 05:30:48,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:30:48" (1/1) ... [2023-11-29 05:30:48,094 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:30:48,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:30:48,644 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 05:30:48,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@653d5e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:48, skipping insertion in model container [2023-11-29 05:30:48,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:30:48,645 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 05:30:48,647 INFO L158 Benchmark]: Toolchain (without parser) took 625.46ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 81.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:30:48,647 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 144.7MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:30:48,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.20ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 81.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:30:48,649 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.16ms. Allocated memory is still 144.7MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.20ms. Allocated memory is still 144.7MB. Free memory was 103.6MB in the beginning and 81.3MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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_866d9bdc-3da8-45f8-9b96-783a39017597/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 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:30:50,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:30:50,496 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:30:50,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:30:50,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:30:50,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:30:50,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:30:50,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:30:50,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:30:50,543 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:30:50,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:30:50,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:30:50,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:30:50,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:30:50,546 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:30:50,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:30:50,547 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:30:50,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:30:50,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:30:50,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:30:50,549 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:30:50,550 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:30:50,550 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:30:50,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:30:50,551 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:30:50,552 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:30:50,552 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:30:50,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:30:50,553 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:30:50,553 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:30:50,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:30:50,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:30:50,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:30:50,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:30:50,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:30:50,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:30:50,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:30:50,556 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:30:50,556 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:30:50,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:30:50,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:30:50,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:30:50,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:30:50,557 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:30:50,557 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_866d9bdc-3da8-45f8-9b96-783a39017597/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_866d9bdc-3da8-45f8-9b96-783a39017597/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 -> 9fd228108b00a337c799c923821cefd2f3f25ea1b43eb489705884efe2b6ca03 [2023-11-29 05:30:50,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:30:50,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:30:50,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:30:50,873 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:30:50,874 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:30:50,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2023-11-29 05:30:53,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:30:53,967 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:30:53,967 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-1.i [2023-11-29 05:30:53,986 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data/9de8ca01e/648cc109de0044a0a7281a81c36bb8d2/FLAG0acd35cba [2023-11-29 05:30:54,001 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/data/9de8ca01e/648cc109de0044a0a7281a81c36bb8d2 [2023-11-29 05:30:54,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:30:54,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:30:54,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:30:54,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:30:54,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:30:54,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:54,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0d331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54, skipping insertion in model container [2023-11-29 05:30:54,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:54,079 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:30:54,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:30:54,627 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 05:30:54,644 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:30:54,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:30:54,743 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:30:54,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:30:54,877 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:30:54,885 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:30:54,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54 WrapperNode [2023-11-29 05:30:54,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:30:54,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:30:54,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:30:54,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:30:54,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:54,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:54,986 INFO L138 Inliner]: procedures = 180, calls = 390, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1418 [2023-11-29 05:30:54,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:30:54,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:30:54,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:30:54,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:30:54,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,119 INFO L175 MemorySlicer]: Split 359 memory accesses to 5 slices as follows [2, 5, 24, 5, 323]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 85 writes are split as follows [0, 1, 1, 1, 82]. [2023-11-29 05:30:55,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,196 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:30:55,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:30:55,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:30:55,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:30:55,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (1/1) ... [2023-11-29 05:30:55,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:30:55,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:30:55,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:30:55,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:30:55,285 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 05:30:55,286 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 05:30:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 05:30:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 05:30:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 05:30:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 05:30:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 05:30:55,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 05:30:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 05:30:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 05:30:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 05:30:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 05:30:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 05:30:55,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 05:30:55,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 05:30:55,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 05:30:55,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 05:30:55,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 05:30:55,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-29 05:30:55,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 05:30:55,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 05:30:55,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 05:30:55,289 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 05:30:55,289 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-29 05:30:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:30:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:30:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 05:30:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 05:30:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 05:30:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 05:30:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:30:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:30:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 05:30:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:30:55,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:30:55,545 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:30:55,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:30:55,581 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:30:55,615 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:30:55,637 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:30:55,659 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:30:55,680 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 05:31:01,446 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:31:01,663 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:31:01,664 INFO L309 CfgBuilder]: Removed 83 assume(true) statements. [2023-11-29 05:31:01,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:31:01 BoogieIcfgContainer [2023-11-29 05:31:01,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:31:01,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:31:01,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:31:01,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:31:01,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:30:54" (1/3) ... [2023-11-29 05:31:01,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377285d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:31:01, skipping insertion in model container [2023-11-29 05:31:01,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:30:54" (2/3) ... [2023-11-29 05:31:01,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377285d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:31:01, skipping insertion in model container [2023-11-29 05:31:01,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:31:01" (3/3) ... [2023-11-29 05:31:01,674 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-1.i [2023-11-29 05:31:01,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:31:01,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 728 error locations. [2023-11-29 05:31:01,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:31:01,787 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;@76c35131, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:31:01,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 728 error locations. [2023-11-29 05:31:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 1324 states, 585 states have (on average 2.517948717948718) internal successors, (1473), 1314 states have internal predecessors, (1473), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 05:31:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:31:01,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:01,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:31:01,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:01,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 70757696, now seen corresponding path program 1 times [2023-11-29 05:31:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:01,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243222802] [2023-11-29 05:31:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:01,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:31:01,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:01,858 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:01,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:02,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:31:02,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:02,109 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 05:31:02,109 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:02,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:02,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243222802] [2023-11-29 05:31:02,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243222802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:02,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:02,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:31:02,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804387141] [2023-11-29 05:31:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:02,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:31:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:31:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:31:02,153 INFO L87 Difference]: Start difference. First operand has 1324 states, 585 states have (on average 2.517948717948718) internal successors, (1473), 1314 states have internal predecessors, (1473), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:03,123 INFO L93 Difference]: Finished difference Result 1304 states and 1386 transitions. [2023-11-29 05:31:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:31:03,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:31:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:03,144 INFO L225 Difference]: With dead ends: 1304 [2023-11-29 05:31:03,144 INFO L226 Difference]: Without dead ends: 1303 [2023-11-29 05:31:03,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:31:03,149 INFO L413 NwaCegarLoop]: 1242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:03,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1242 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:31:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2023-11-29 05:31:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2023-11-29 05:31:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 576 states have (on average 2.3628472222222223) internal successors, (1361), 1293 states have internal predecessors, (1361), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1385 transitions. [2023-11-29 05:31:03,237 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1385 transitions. Word has length 4 [2023-11-29 05:31:03,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:03,237 INFO L495 AbstractCegarLoop]: Abstraction has 1303 states and 1385 transitions. [2023-11-29 05:31:03,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1385 transitions. [2023-11-29 05:31:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:31:03,238 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:03,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:31:03,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:03,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:03,439 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:03,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 70757758, now seen corresponding path program 1 times [2023-11-29 05:31:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146135516] [2023-11-29 05:31:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:03,441 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 05:31:03,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:03,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:03,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:03,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:31:03,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:03,654 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 05:31:03,667 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 05:31:03,668 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:03,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:03,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146135516] [2023-11-29 05:31:03,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146135516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:03,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:03,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:31:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903621498] [2023-11-29 05:31:03,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:03,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:31:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:31:03,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:31:03,671 INFO L87 Difference]: Start difference. First operand 1303 states and 1385 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:06,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:06,480 INFO L93 Difference]: Finished difference Result 1532 states and 1658 transitions. [2023-11-29 05:31:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:31:06,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:31:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:06,487 INFO L225 Difference]: With dead ends: 1532 [2023-11-29 05:31:06,487 INFO L226 Difference]: Without dead ends: 1532 [2023-11-29 05:31:06,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 05:31:06,488 INFO L413 NwaCegarLoop]: 778 mSDtfsCounter, 1235 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:06,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1014 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 05:31:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2023-11-29 05:31:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1278. [2023-11-29 05:31:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 642 states have (on average 2.1728971962616823) internal successors, (1395), 1268 states have internal predecessors, (1395), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1419 transitions. [2023-11-29 05:31:06,518 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1419 transitions. Word has length 4 [2023-11-29 05:31:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:06,519 INFO L495 AbstractCegarLoop]: Abstraction has 1278 states and 1419 transitions. [2023-11-29 05:31:06,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1419 transitions. [2023-11-29 05:31:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:31:06,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:06,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:31:06,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:06,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:06,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:06,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash 70757759, now seen corresponding path program 1 times [2023-11-29 05:31:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316295947] [2023-11-29 05:31:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:06,721 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 05:31:06,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:06,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:06,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:06,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:31:06,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:06,846 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 05:31:06,867 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 05:31:06,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:06,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:06,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316295947] [2023-11-29 05:31:06,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316295947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:06,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:06,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:31:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653204020] [2023-11-29 05:31:06,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:06,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:31:06,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:06,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:31:06,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:31:06,870 INFO L87 Difference]: Start difference. First operand 1278 states and 1419 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:11,150 INFO L93 Difference]: Finished difference Result 1749 states and 1940 transitions. [2023-11-29 05:31:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:31:11,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:31:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:11,160 INFO L225 Difference]: With dead ends: 1749 [2023-11-29 05:31:11,160 INFO L226 Difference]: Without dead ends: 1749 [2023-11-29 05:31:11,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 05:31:11,162 INFO L413 NwaCegarLoop]: 1107 mSDtfsCounter, 675 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:11,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1598 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 05:31:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2023-11-29 05:31:11,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1401. [2023-11-29 05:31:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 775 states have (on average 2.152258064516129) internal successors, (1668), 1391 states have internal predecessors, (1668), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1692 transitions. [2023-11-29 05:31:11,206 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1692 transitions. Word has length 4 [2023-11-29 05:31:11,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:11,206 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1692 transitions. [2023-11-29 05:31:11,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1692 transitions. [2023-11-29 05:31:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 05:31:11,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:11,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:31:11,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:11,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:11,408 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:11,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2099785487, now seen corresponding path program 1 times [2023-11-29 05:31:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:11,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333149065] [2023-11-29 05:31:11,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:11,409 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 05:31:11,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:11,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:11,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:11,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:31:11,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:11,547 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 05:31:11,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:11,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333149065] [2023-11-29 05:31:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333149065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:11,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:11,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:31:11,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210143952] [2023-11-29 05:31:11,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:11,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:31:11,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:11,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:31:11,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:31:11,550 INFO L87 Difference]: Start difference. First operand 1401 states and 1692 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 05:31:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:13,121 INFO L93 Difference]: Finished difference Result 2786 states and 3368 transitions. [2023-11-29 05:31:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:31:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 05:31:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:13,134 INFO L225 Difference]: With dead ends: 2786 [2023-11-29 05:31:13,134 INFO L226 Difference]: Without dead ends: 2786 [2023-11-29 05:31:13,134 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 05:31:13,135 INFO L413 NwaCegarLoop]: 1134 mSDtfsCounter, 1243 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:13,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 2265 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 05:31:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2023-11-29 05:31:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1403. [2023-11-29 05:31:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 777 states have (on average 2.1492921492921493) internal successors, (1670), 1393 states have internal predecessors, (1670), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1694 transitions. [2023-11-29 05:31:13,168 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1694 transitions. Word has length 5 [2023-11-29 05:31:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:13,169 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1694 transitions. [2023-11-29 05:31:13,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 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 05:31:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1694 transitions. [2023-11-29 05:31:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:31:13,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:13,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:31:13,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:31:13,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:13,373 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:13,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:13,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1404939320, now seen corresponding path program 1 times [2023-11-29 05:31:13,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:13,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443924912] [2023-11-29 05:31:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:13,374 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 05:31:13,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:13,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:13,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:13,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 05:31:13,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:13,567 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 05:31:13,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:13,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443924912] [2023-11-29 05:31:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443924912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:31:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594683949] [2023-11-29 05:31:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:13,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:31:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:31:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:31:13,570 INFO L87 Difference]: Start difference. First operand 1403 states and 1694 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:14,607 INFO L93 Difference]: Finished difference Result 1364 states and 1654 transitions. [2023-11-29 05:31:14,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:31:14,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 05:31:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:14,615 INFO L225 Difference]: With dead ends: 1364 [2023-11-29 05:31:14,615 INFO L226 Difference]: Without dead ends: 1364 [2023-11-29 05:31:14,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 05:31:14,616 INFO L413 NwaCegarLoop]: 1092 mSDtfsCounter, 70 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:14,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2135 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:31:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-11-29 05:31:14,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2023-11-29 05:31:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 762 states have (on average 2.1391076115485563) internal successors, (1630), 1354 states have internal predecessors, (1630), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1654 transitions. [2023-11-29 05:31:14,648 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1654 transitions. Word has length 10 [2023-11-29 05:31:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:14,648 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 1654 transitions. [2023-11-29 05:31:14,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1654 transitions. [2023-11-29 05:31:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 05:31:14,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:14,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:31:14,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:31:14,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:14,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:14,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1526958302, now seen corresponding path program 1 times [2023-11-29 05:31:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:14,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439089007] [2023-11-29 05:31:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:14,853 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 05:31:14,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:14,854 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:14,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:14,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:31:14,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:15,002 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 05:31:15,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:15,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:15,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439089007] [2023-11-29 05:31:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439089007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:31:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728585983] [2023-11-29 05:31:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:15,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:31:15,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:31:15,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:31:15,004 INFO L87 Difference]: Start difference. First operand 1364 states and 1654 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 05:31:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:16,375 INFO L93 Difference]: Finished difference Result 1350 states and 1633 transitions. [2023-11-29 05:31:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:31:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-29 05:31:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:16,382 INFO L225 Difference]: With dead ends: 1350 [2023-11-29 05:31:16,382 INFO L226 Difference]: Without dead ends: 1350 [2023-11-29 05:31:16,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 05:31:16,383 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 58 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:16,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3159 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 05:31:16,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2023-11-29 05:31:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1349. [2023-11-29 05:31:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 761 states have (on average 2.1130091984231276) internal successors, (1608), 1339 states have internal predecessors, (1608), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1632 transitions. [2023-11-29 05:31:16,406 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1632 transitions. Word has length 12 [2023-11-29 05:31:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:16,406 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1632 transitions. [2023-11-29 05:31:16,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 05:31:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1632 transitions. [2023-11-29 05:31:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:31:16,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:16,408 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] [2023-11-29 05:31:16,410 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Ended with exit code 0 [2023-11-29 05:31:16,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:16,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:16,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1678685040, now seen corresponding path program 1 times [2023-11-29 05:31:16,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:16,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385047136] [2023-11-29 05:31:16,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:16,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:31:16,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:16,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:16,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:16,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:31:16,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:16,759 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 05:31:16,831 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 05:31:16,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:16,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:16,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385047136] [2023-11-29 05:31:16,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385047136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:16,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:16,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:31:16,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514251837] [2023-11-29 05:31:16,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:16,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:31:16,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:16,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:31:16,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:31:16,833 INFO L87 Difference]: Start difference. First operand 1349 states and 1632 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:20,084 INFO L93 Difference]: Finished difference Result 1600 states and 1868 transitions. [2023-11-29 05:31:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:31:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 05:31:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:20,091 INFO L225 Difference]: With dead ends: 1600 [2023-11-29 05:31:20,091 INFO L226 Difference]: Without dead ends: 1600 [2023-11-29 05:31:20,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 05:31:20,092 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 1170 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:20,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1249 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 05:31:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2023-11-29 05:31:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1345. [2023-11-29 05:31:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 761 states have (on average 2.107752956636005) internal successors, (1604), 1335 states have internal predecessors, (1604), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:20,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1628 transitions. [2023-11-29 05:31:20,125 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1628 transitions. Word has length 26 [2023-11-29 05:31:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:20,126 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1628 transitions. [2023-11-29 05:31:20,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1628 transitions. [2023-11-29 05:31:20,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 05:31:20,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:20,127 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] [2023-11-29 05:31:20,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Ended with exit code 0 [2023-11-29 05:31:20,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:20,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:20,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1678685039, now seen corresponding path program 1 times [2023-11-29 05:31:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:20,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919578099] [2023-11-29 05:31:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:20,329 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 05:31:20,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:20,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:20,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:20,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:31:20,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:20,480 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 05:31:20,680 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 05:31:20,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:20,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919578099] [2023-11-29 05:31:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919578099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:31:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999824483] [2023-11-29 05:31:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:20,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:31:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:20,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:31:20,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:31:20,683 INFO L87 Difference]: Start difference. First operand 1345 states and 1628 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:25,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:25,708 INFO L93 Difference]: Finished difference Result 1690 states and 1873 transitions. [2023-11-29 05:31:25,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:31:25,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 05:31:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:25,715 INFO L225 Difference]: With dead ends: 1690 [2023-11-29 05:31:25,715 INFO L226 Difference]: Without dead ends: 1690 [2023-11-29 05:31:25,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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 05:31:25,716 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 612 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:25,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1854 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 05:31:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2023-11-29 05:31:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1341. [2023-11-29 05:31:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 761 states have (on average 2.102496714848883) internal successors, (1600), 1331 states have internal predecessors, (1600), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1624 transitions. [2023-11-29 05:31:25,740 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1624 transitions. Word has length 26 [2023-11-29 05:31:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:25,740 INFO L495 AbstractCegarLoop]: Abstraction has 1341 states and 1624 transitions. [2023-11-29 05:31:25,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1624 transitions. [2023-11-29 05:31:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 05:31:25,742 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:25,742 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] [2023-11-29 05:31:25,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:25,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:25,943 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:25,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:25,943 INFO L85 PathProgramCache]: Analyzing trace with hash -316092918, now seen corresponding path program 1 times [2023-11-29 05:31:25,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:25,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381866668] [2023-11-29 05:31:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:25,943 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 05:31:25,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:25,944 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:25,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:26,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:31:26,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:26,214 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 05:31:26,214 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:26,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:26,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381866668] [2023-11-29 05:31:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381866668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:26,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:26,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:31:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825895254] [2023-11-29 05:31:26,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:31:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:31:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:31:26,216 INFO L87 Difference]: Start difference. First operand 1341 states and 1624 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 05:31:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:27,473 INFO L93 Difference]: Finished difference Result 1335 states and 1614 transitions. [2023-11-29 05:31:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:31:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2023-11-29 05:31:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:27,479 INFO L225 Difference]: With dead ends: 1335 [2023-11-29 05:31:27,479 INFO L226 Difference]: Without dead ends: 1335 [2023-11-29 05:31:27,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 05:31:27,480 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 23 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:27,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3145 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 05:31:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2023-11-29 05:31:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2023-11-29 05:31:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 755 states have (on average 2.1059602649006623) internal successors, (1590), 1325 states have internal predecessors, (1590), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:27,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1614 transitions. [2023-11-29 05:31:27,501 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1614 transitions. Word has length 42 [2023-11-29 05:31:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:27,501 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1614 transitions. [2023-11-29 05:31:27,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 05:31:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1614 transitions. [2023-11-29 05:31:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 05:31:27,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:27,504 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 05:31:27,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:27,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:27,705 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:27,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -449345878, now seen corresponding path program 1 times [2023-11-29 05:31:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:27,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687431585] [2023-11-29 05:31:27,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:27,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:31:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:27,707 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:27,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:27,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:31:27,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:28,185 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 05:31:28,185 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:28,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687431585] [2023-11-29 05:31:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687431585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:28,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:28,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:31:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477338641] [2023-11-29 05:31:28,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:28,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:31:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:28,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:31:28,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:31:28,187 INFO L87 Difference]: Start difference. First operand 1335 states and 1614 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 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 05:31:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:29,227 INFO L93 Difference]: Finished difference Result 1378 states and 1657 transitions. [2023-11-29 05:31:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:31:29,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 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 05:31:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:29,236 INFO L225 Difference]: With dead ends: 1378 [2023-11-29 05:31:29,236 INFO L226 Difference]: Without dead ends: 1378 [2023-11-29 05:31:29,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 05:31:29,237 INFO L413 NwaCegarLoop]: 1070 mSDtfsCounter, 59 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:29,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2062 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:31:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-11-29 05:31:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2023-11-29 05:31:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 798 states have (on average 2.0463659147869673) internal successors, (1633), 1368 states have internal predecessors, (1633), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1657 transitions. [2023-11-29 05:31:29,270 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1657 transitions. Word has length 46 [2023-11-29 05:31:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:29,271 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1657 transitions. [2023-11-29 05:31:29,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 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 05:31:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1657 transitions. [2023-11-29 05:31:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:31:29,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:29,273 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] [2023-11-29 05:31:29,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:31:29,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:29,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:29,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash 842573049, now seen corresponding path program 1 times [2023-11-29 05:31:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:29,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859878078] [2023-11-29 05:31:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:29,479 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 05:31:29,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:29,481 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:29,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:29,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:31:29,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:29,859 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 05:31:29,868 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 05:31:30,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:31:30,363 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 05:31:30,381 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:31:30,381 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 05:31:30,402 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 05:31:30,402 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:30,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:30,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859878078] [2023-11-29 05:31:30,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859878078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:30,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:30,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:31:30,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160940561] [2023-11-29 05:31:30,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:30,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:31:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:30,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:31:30,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:31:30,405 INFO L87 Difference]: Start difference. First operand 1378 states and 1657 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:34,114 INFO L93 Difference]: Finished difference Result 1548 states and 1812 transitions. [2023-11-29 05:31:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:31:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-11-29 05:31:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:34,120 INFO L225 Difference]: With dead ends: 1548 [2023-11-29 05:31:34,120 INFO L226 Difference]: Without dead ends: 1548 [2023-11-29 05:31:34,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 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 05:31:34,121 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 1380 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:34,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 458 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 05:31:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2023-11-29 05:31:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1161. [2023-11-29 05:31:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 665 states have (on average 1.9022556390977443) internal successors, (1265), 1151 states have internal predecessors, (1265), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1289 transitions. [2023-11-29 05:31:34,143 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1289 transitions. Word has length 49 [2023-11-29 05:31:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:34,144 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1289 transitions. [2023-11-29 05:31:34,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:31:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1289 transitions. [2023-11-29 05:31:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:31:34,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:34,145 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] [2023-11-29 05:31:34,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:34,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:34,347 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:34,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -604104386, now seen corresponding path program 1 times [2023-11-29 05:31:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909708077] [2023-11-29 05:31:34,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:34,349 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 05:31:34,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:34,350 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:34,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:34,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:31:34,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:34,634 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 05:31:34,652 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 05:31:34,673 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 05:31:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:31:34,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:34,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909708077] [2023-11-29 05:31:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909708077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:31:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893340031] [2023-11-29 05:31:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:34,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:31:34,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:31:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:31:34,687 INFO L87 Difference]: Start difference. First operand 1161 states and 1289 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:31:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:38,274 INFO L93 Difference]: Finished difference Result 1160 states and 1288 transitions. [2023-11-29 05:31:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:31:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2023-11-29 05:31:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:38,279 INFO L225 Difference]: With dead ends: 1160 [2023-11-29 05:31:38,279 INFO L226 Difference]: Without dead ends: 1160 [2023-11-29 05:31:38,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 05:31:38,280 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 3 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:38,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2562 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-11-29 05:31:38,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-11-29 05:31:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2023-11-29 05:31:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 665 states have (on average 1.9007518796992482) internal successors, (1264), 1150 states have internal predecessors, (1264), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1288 transitions. [2023-11-29 05:31:38,293 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1288 transitions. Word has length 53 [2023-11-29 05:31:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:38,293 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1288 transitions. [2023-11-29 05:31:38,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:31:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1288 transitions. [2023-11-29 05:31:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 05:31:38,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:38,295 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] [2023-11-29 05:31:38,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:38,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:38,497 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:38,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:38,497 INFO L85 PathProgramCache]: Analyzing trace with hash -604104385, now seen corresponding path program 1 times [2023-11-29 05:31:38,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:38,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167613049] [2023-11-29 05:31:38,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:38,498 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 05:31:38,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:38,499 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:38,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:38,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:31:38,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:38,790 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 05:31:38,808 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 05:31:38,816 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 05:31:38,855 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 05:31:38,873 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 05:31:38,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:38,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:38,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167613049] [2023-11-29 05:31:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167613049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:31:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093392652] [2023-11-29 05:31:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:38,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:31:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:38,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:31:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:31:38,875 INFO L87 Difference]: Start difference. First operand 1160 states and 1288 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:31:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:43,460 INFO L93 Difference]: Finished difference Result 1159 states and 1287 transitions. [2023-11-29 05:31:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:31:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2023-11-29 05:31:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:43,465 INFO L225 Difference]: With dead ends: 1159 [2023-11-29 05:31:43,465 INFO L226 Difference]: Without dead ends: 1159 [2023-11-29 05:31:43,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 05:31:43,466 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 1 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:43,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2592 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 05:31:43,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2023-11-29 05:31:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2023-11-29 05:31:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 664 states have (on average 1.9021084337349397) internal successors, (1263), 1149 states have internal predecessors, (1263), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 05:31:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1287 transitions. [2023-11-29 05:31:43,479 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1287 transitions. Word has length 53 [2023-11-29 05:31:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:43,480 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1287 transitions. [2023-11-29 05:31:43,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 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 05:31:43,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1287 transitions. [2023-11-29 05:31:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 05:31:43,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:43,480 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] [2023-11-29 05:31:43,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:43,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:43,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:43,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1729204190, now seen corresponding path program 1 times [2023-11-29 05:31:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488920385] [2023-11-29 05:31:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:43,682 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 05:31:43,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:43,683 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:43,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:43,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:31:43,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:43,934 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 05:31:43,934 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:31:43,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488920385] [2023-11-29 05:31:43,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488920385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:31:43,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:31:43,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:31:43,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280211303] [2023-11-29 05:31:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:31:43,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:31:43,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:31:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:31:43,936 INFO L87 Difference]: Start difference. First operand 1159 states and 1287 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 05:31:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:45,266 INFO L93 Difference]: Finished difference Result 1161 states and 1291 transitions. [2023-11-29 05:31:45,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:31:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2023-11-29 05:31:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:45,273 INFO L225 Difference]: With dead ends: 1161 [2023-11-29 05:31:45,274 INFO L226 Difference]: Without dead ends: 1161 [2023-11-29 05:31:45,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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 05:31:45,274 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 1 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:45,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2940 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 05:31:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2023-11-29 05:31:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2023-11-29 05:31:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 665 states have (on average 1.9022556390977443) internal successors, (1265), 1151 states have internal predecessors, (1265), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:31:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1291 transitions. [2023-11-29 05:31:45,296 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1291 transitions. Word has length 59 [2023-11-29 05:31:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:45,297 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1291 transitions. [2023-11-29 05:31:45,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 05:31:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1291 transitions. [2023-11-29 05:31:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 05:31:45,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:45,298 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 05:31:45,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Ended with exit code 0 [2023-11-29 05:31:45,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:45,498 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:45,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash 372949402, now seen corresponding path program 1 times [2023-11-29 05:31:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:45,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463235886] [2023-11-29 05:31:45,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:31:45,499 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 05:31:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:45,500 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:45,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:31:45,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:31:45,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:45,769 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 05:31:45,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:31:45,825 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 05:31:45,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:45,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463235886] [2023-11-29 05:31:45,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463235886] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:31:45,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:31:45,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 05:31:45,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066969587] [2023-11-29 05:31:45,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:31:45,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:31:45,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:45,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:31:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:31:45,827 INFO L87 Difference]: Start difference. First operand 1161 states and 1291 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 05:31:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:47,551 INFO L93 Difference]: Finished difference Result 1170 states and 1306 transitions. [2023-11-29 05:31:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:31:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2023-11-29 05:31:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:47,557 INFO L225 Difference]: With dead ends: 1170 [2023-11-29 05:31:47,557 INFO L226 Difference]: Without dead ends: 1170 [2023-11-29 05:31:47,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:31:47,558 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 6 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3910 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:47,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3910 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 05:31:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2023-11-29 05:31:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1169. [2023-11-29 05:31:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 672 states have (on average 1.9017857142857142) internal successors, (1278), 1158 states have internal predecessors, (1278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:31:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1304 transitions. [2023-11-29 05:31:47,575 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1304 transitions. Word has length 60 [2023-11-29 05:31:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:47,576 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1304 transitions. [2023-11-29 05:31:47,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 05:31:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1304 transitions. [2023-11-29 05:31:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 05:31:47,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:47,576 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] [2023-11-29 05:31:47,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:47,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:47,777 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:47,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:47,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1305276894, now seen corresponding path program 2 times [2023-11-29 05:31:47,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:47,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384743745] [2023-11-29 05:31:47,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:31:47,778 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 05:31:47,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:47,778 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:47,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:48,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:31:48,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:31:48,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:31:48,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:48,235 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 05:31:48,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:31:48,375 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 05:31:48,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:48,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384743745] [2023-11-29 05:31:48,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384743745] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:31:48,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:31:48,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 05:31:48,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930704370] [2023-11-29 05:31:48,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:31:48,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:31:48,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:48,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:31:48,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:31:48,378 INFO L87 Difference]: Start difference. First operand 1169 states and 1304 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 05:31:51,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:51,043 INFO L93 Difference]: Finished difference Result 1184 states and 1330 transitions. [2023-11-29 05:31:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 05:31:51,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 63 [2023-11-29 05:31:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:51,050 INFO L225 Difference]: With dead ends: 1184 [2023-11-29 05:31:51,050 INFO L226 Difference]: Without dead ends: 1182 [2023-11-29 05:31:51,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 05:31:51,051 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 12 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5870 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:51,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5870 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 05:31:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-11-29 05:31:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1178. [2023-11-29 05:31:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 681 states have (on average 1.894273127753304) internal successors, (1290), 1167 states have internal predecessors, (1290), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:31:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1316 transitions. [2023-11-29 05:31:51,068 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1316 transitions. Word has length 63 [2023-11-29 05:31:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:51,068 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1316 transitions. [2023-11-29 05:31:51,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 05:31:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1316 transitions. [2023-11-29 05:31:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 05:31:51,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:51,069 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] [2023-11-29 05:31:51,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:31:51,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:51,269 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:51,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1273223970, now seen corresponding path program 3 times [2023-11-29 05:31:51,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:51,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759581679] [2023-11-29 05:31:51,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:31:51,270 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 05:31:51,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:51,271 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:51,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:51,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 05:31:51,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:31:51,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:31:51,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:31:52,024 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 05:31:52,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:31:52,591 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 05:31:52,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:31:52,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759581679] [2023-11-29 05:31:52,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759581679] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:31:52,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:31:52,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 05:31:52,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926998282] [2023-11-29 05:31:52,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:31:52,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 05:31:52,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:31:52,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 05:31:52,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 05:31:52,594 INFO L87 Difference]: Start difference. First operand 1178 states and 1316 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 05:31:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:31:59,769 INFO L93 Difference]: Finished difference Result 1208 states and 1380 transitions. [2023-11-29 05:31:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 05:31:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 69 [2023-11-29 05:31:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:31:59,774 INFO L225 Difference]: With dead ends: 1208 [2023-11-29 05:31:59,774 INFO L226 Difference]: Without dead ends: 1205 [2023-11-29 05:31:59,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 05:31:59,775 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 24 mSDsluCounter, 11706 mSDsCounter, 0 mSdLazyCounter, 2642 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12684 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:31:59,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12684 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2642 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-29 05:31:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-11-29 05:31:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1196. [2023-11-29 05:31:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 699 states have (on average 1.8783977110157368) internal successors, (1313), 1185 states have internal predecessors, (1313), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:31:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1339 transitions. [2023-11-29 05:31:59,794 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1339 transitions. Word has length 69 [2023-11-29 05:31:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:31:59,794 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1339 transitions. [2023-11-29 05:31:59,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 05:31:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1339 transitions. [2023-11-29 05:31:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 05:31:59,795 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:31:59,795 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] [2023-11-29 05:31:59,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:31:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:59,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:31:59,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:31:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1125370590, now seen corresponding path program 4 times [2023-11-29 05:31:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:31:59,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330746701] [2023-11-29 05:31:59,996 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:31:59,997 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 05:31:59,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:31:59,997 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:31:59,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:32:00,371 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:32:00,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:32:00,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 05:32:00,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:32:00,728 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 05:32:00,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:32:02,198 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 05:32:02,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:32:02,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330746701] [2023-11-29 05:32:02,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330746701] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:32:02,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:32:02,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 05:32:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401316931] [2023-11-29 05:32:02,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:32:02,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 05:32:02,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:32:02,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 05:32:02,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 05:32:02,202 INFO L87 Difference]: Start difference. First operand 1196 states and 1339 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 05:32:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:19,456 INFO L93 Difference]: Finished difference Result 1253 states and 1449 transitions. [2023-11-29 05:32:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 05:32:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2023-11-29 05:32:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:19,462 INFO L225 Difference]: With dead ends: 1253 [2023-11-29 05:32:19,462 INFO L226 Difference]: Without dead ends: 1251 [2023-11-29 05:32:19,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 05:32:19,467 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 47 mSDsluCounter, 24446 mSDsCounter, 0 mSdLazyCounter, 6445 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25426 SdHoareTripleChecker+Invalid, 6530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 6445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:19,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 25426 Invalid, 6530 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 6445 Invalid, 0 Unknown, 0 Unchecked, 12.2s Time] [2023-11-29 05:32:19,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-11-29 05:32:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1230. [2023-11-29 05:32:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 733 states have (on average 1.854024556616644) internal successors, (1359), 1219 states have internal predecessors, (1359), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:32:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1385 transitions. [2023-11-29 05:32:19,496 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1385 transitions. Word has length 81 [2023-11-29 05:32:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:19,496 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1385 transitions. [2023-11-29 05:32:19,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 05:32:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1385 transitions. [2023-11-29 05:32:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:32:19,498 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:19,498 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] [2023-11-29 05:32:19,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:32:19,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:32:19,704 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:32:19,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1075329570, now seen corresponding path program 5 times [2023-11-29 05:32:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:32:19,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565438641] [2023-11-29 05:32:19,705 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:32:19,705 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 05:32:19,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:32:19,706 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:32:19,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:32:21,017 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 05:32:21,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:32:21,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 05:32:21,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:32:21,060 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 05:32:21,158 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:32:21,158 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 05:32:21,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 19 treesize of output 1 [2023-11-29 05:32:21,279 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 05:32:22,313 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:32:22,314 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 05:32:22,360 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 05:32:22,400 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 05:32:22,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:32:22,801 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1686 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1686) |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 05:32:22,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:32:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565438641] [2023-11-29 05:32:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565438641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:32:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1642735851] [2023-11-29 05:32:22,804 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:32:22,804 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:32:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:32:22,805 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:32:22,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 05:33:26,189 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 05:33:26,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:33:26,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 05:33:26,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:26,393 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 05:33:26,627 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:33:26,628 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 05:33:26,676 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 05:33:27,209 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:33:27,209 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 36 treesize of output 35 [2023-11-29 05:33:27,270 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 27 treesize of output 15 [2023-11-29 05:33:27,274 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 05:33:27,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:33:27,691 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 05:33:27,691 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 05:33:27,697 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2133) |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 05:33:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1642735851] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:27,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:33:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-29 05:33:27,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089314175] [2023-11-29 05:33:27,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:33:27,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 05:33:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:33:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 05:33:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=294, Unknown=2, NotChecked=70, Total=420 [2023-11-29 05:33:27,701 INFO L87 Difference]: Start difference. First operand 1230 states and 1385 transitions. Second operand has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 05:33:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:41,105 INFO L93 Difference]: Finished difference Result 2029 states and 2219 transitions. [2023-11-29 05:33:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 05:33:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 103 [2023-11-29 05:33:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:41,110 INFO L225 Difference]: With dead ends: 2029 [2023-11-29 05:33:41,110 INFO L226 Difference]: Without dead ends: 2027 [2023-11-29 05:33:41,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=504, Unknown=2, NotChecked=94, Total=702 [2023-11-29 05:33:41,111 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 1551 mSDsluCounter, 5681 mSDsCounter, 0 mSdLazyCounter, 7462 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 6199 SdHoareTripleChecker+Invalid, 7502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 7462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:41,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 6199 Invalid, 7502 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 7462 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2023-11-29 05:33:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2023-11-29 05:33:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1276. [2023-11-29 05:33:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 779 states have (on average 1.803594351732991) internal successors, (1405), 1264 states have internal predecessors, (1405), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:33:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1431 transitions. [2023-11-29 05:33:41,137 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1431 transitions. Word has length 103 [2023-11-29 05:33:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:41,138 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1431 transitions. [2023-11-29 05:33:41,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 05:33:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1431 transitions. [2023-11-29 05:33:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:33:41,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:41,139 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] [2023-11-29 05:33:41,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 05:33:41,348 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:33:41,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:33:41,540 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:33:41,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1075329571, now seen corresponding path program 1 times [2023-11-29 05:33:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:33:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265221241] [2023-11-29 05:33:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:41,541 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 05:33:41,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:33:41,542 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:33:41,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 (22)] Waiting until timeout for monitored process [2023-11-29 05:33:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:42,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 05:33:42,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:42,259 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 05:33:42,494 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:33:42,495 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 05:33:42,502 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 05:33:42,531 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 05:33:42,544 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 05:33:42,639 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 05:33:42,644 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 05:33:43,425 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:33:43,426 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 05:33:43,438 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 05:33:43,500 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 05:33:43,505 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 05:33:43,535 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 05:33:43,536 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:33:44,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2671 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:33:45,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:33:45,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265221241] [2023-11-29 05:33:45,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265221241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:45,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1930797826] [2023-11-29 05:33:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:45,001 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:33:45,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:33:45,002 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:33:45,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 05:35:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:28,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 05:35:28,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:35:28,297 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 05:35:28,526 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 05:35:28,541 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:35:28,541 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 05:35:28,562 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 05:35:28,569 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 05:35:28,630 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 05:35:28,635 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 05:35:29,303 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:35:29,304 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 05:35:29,317 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 05:35:29,368 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 05:35:29,374 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 05:35:29,380 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 05:35:29,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:35:30,574 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3211 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3210 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3211) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:35:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1930797826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:35:30,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:35:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 05:35:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749154933] [2023-11-29 05:35:30,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:35:30,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:35:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:35:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:35:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 05:35:30,581 INFO L87 Difference]: Start difference. First operand 1276 states and 1431 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 05:35:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:41,352 INFO L93 Difference]: Finished difference Result 1817 states and 1971 transitions. [2023-11-29 05:35:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:35:41,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 103 [2023-11-29 05:35:41,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:41,356 INFO L225 Difference]: With dead ends: 1817 [2023-11-29 05:35:41,356 INFO L226 Difference]: Without dead ends: 1817 [2023-11-29 05:35:41,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 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 05:35:41,357 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 923 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 4998 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 5009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:41,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 2473 Invalid, 5009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4998 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-11-29 05:35:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2023-11-29 05:35:41,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1275. [2023-11-29 05:35:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 779 states have (on average 1.8023106546854941) internal successors, (1404), 1263 states have internal predecessors, (1404), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:35:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1430 transitions. [2023-11-29 05:35:41,378 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1430 transitions. Word has length 103 [2023-11-29 05:35:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:41,379 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1430 transitions. [2023-11-29 05:35:41,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 05:35:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1430 transitions. [2023-11-29 05:35:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:35:41,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:41,381 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] [2023-11-29 05:35:41,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-11-29 05:35:41,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 (22)] Ended with exit code 0 [2023-11-29 05:35:41,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:35:41,787 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:35:41,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:41,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1693445234, now seen corresponding path program 1 times [2023-11-29 05:35:41,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:35:41,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470781173] [2023-11-29 05:35:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:41,788 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 05:35:41,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:35:41,789 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:35:41,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Waiting until timeout for monitored process [2023-11-29 05:35:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:42,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 05:35:42,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:35:42,579 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 05:35:42,683 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:35:42,683 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 05:35:42,718 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 05:35:42,814 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 05:35:43,751 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:35:43,752 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 05:35:43,865 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:35:43,865 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 05:35:43,878 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 05:35:43,914 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 05:35:43,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:35:48,031 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3619 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3619) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:35:48,424 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3619 (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$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3665))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3619)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 05:35:48,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:35:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470781173] [2023-11-29 05:35:48,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470781173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:35:48,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1965182166] [2023-11-29 05:35:48,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:35:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:35:48,428 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:35:48,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 05:35:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:51,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 05:35:51,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:35:51,631 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 05:35:51,936 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:35:51,936 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 05:35:51,980 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 05:35:52,660 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:35:52,660 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 36 treesize of output 35 [2023-11-29 05:35:52,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:35:52,824 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 36 treesize of output 35 [2023-11-29 05:35:52,833 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 27 treesize of output 15 [2023-11-29 05:35:52,837 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 05:35:52,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:35:52,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4072) |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 05:35:52,863 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4072) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:35:53,274 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 05:35:53,274 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 05:35:53,284 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4072 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4118 (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$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4118))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4072)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 05:35:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1965182166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:35:53,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:35:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-11-29 05:35:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659815788] [2023-11-29 05:35:53,287 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:35:53,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:35:53,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:35:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:35:53,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=402, Unknown=6, NotChecked=220, Total=702 [2023-11-29 05:35:53,288 INFO L87 Difference]: Start difference. First operand 1275 states and 1430 transitions. Second operand has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 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 05:36:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:12,755 INFO L93 Difference]: Finished difference Result 2025 states and 2213 transitions. [2023-11-29 05:36:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:36:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 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 105 [2023-11-29 05:36:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:12,760 INFO L225 Difference]: With dead ends: 2025 [2023-11-29 05:36:12,761 INFO L226 Difference]: Without dead ends: 2025 [2023-11-29 05:36:12,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=134, Invalid=692, Unknown=6, NotChecked=290, Total=1122 [2023-11-29 05:36:12,762 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 1548 mSDsluCounter, 6655 mSDsCounter, 0 mSdLazyCounter, 8693 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 7172 SdHoareTripleChecker+Invalid, 8733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 8693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:36:12,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 7172 Invalid, 8733 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 8693 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2023-11-29 05:36:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2023-11-29 05:36:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1274. [2023-11-29 05:36:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 779 states have (on average 1.8010269576379974) internal successors, (1403), 1262 states have internal predecessors, (1403), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:36:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1429 transitions. [2023-11-29 05:36:12,790 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1429 transitions. Word has length 105 [2023-11-29 05:36:12,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:12,790 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1429 transitions. [2023-11-29 05:36:12,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 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 05:36:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1429 transitions. [2023-11-29 05:36:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 05:36:12,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:12,791 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] [2023-11-29 05:36:12,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-11-29 05:36:13,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Ended with exit code 0 [2023-11-29 05:36:13,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:36:13,192 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:36:13,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1693445233, now seen corresponding path program 1 times [2023-11-29 05:36:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:36:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188263727] [2023-11-29 05:36:13,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:13,193 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 05:36:13,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:36:13,194 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:36:13,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 (26)] Waiting until timeout for monitored process [2023-11-29 05:36:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:13,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 05:36:13,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:36:14,002 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 05:36:14,296 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:36:14,296 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 05:36:14,304 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 05:36:14,333 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 05:36:14,339 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 05:36:14,441 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 05:36:14,446 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 05:36:15,149 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:36:15,150 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 05:36:15,161 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 05:36:15,282 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:36:15,282 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 05:36:15,287 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 05:36:15,312 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 05:36:15,319 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 05:36:15,351 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 05:36:15,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:36:15,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_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:36:15,558 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_4573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_4572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_4573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-29 05:36:17,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4664) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4665) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4665))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4664) .cse2 v_ArrVal_4573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:36:17,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:36:17,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188263727] [2023-11-29 05:36:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188263727] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:36:17,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1325152253] [2023-11-29 05:36:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:17,041 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:36:17,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:36:17,041 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:36:17,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 05:38:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:19,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 05:38:19,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:19,744 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 05:38:19,995 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:38:19,995 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 05:38:20,007 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 05:38:20,020 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 05:38:20,023 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 05:38:20,084 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 05:38:20,089 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 05:38:20,741 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:38:20,741 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 05:38:20,746 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 05:38:20,822 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:38:20,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 50 treesize of output 45 [2023-11-29 05:38:20,831 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 05:38:20,842 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 05:38:20,848 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 05:38:20,850 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 05:38:20,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:20,907 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5120 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5120 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:38:20,938 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5120 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_5120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5120 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_5120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_5119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:38:22,166 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5119 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5211 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5212))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5211) .cse0 v_ArrVal_5120) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5119) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5212 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5120 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5211 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5211) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5120) |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 05:38:22,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1325152253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:22,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:38:22,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 05:38:22,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959546582] [2023-11-29 05:38:22,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:38:22,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:38:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:38:22,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:38:22,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 05:38:22,180 INFO L87 Difference]: Start difference. First operand 1274 states and 1429 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 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 05:38:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:38:37,776 INFO L93 Difference]: Finished difference Result 1815 states and 1969 transitions. [2023-11-29 05:38:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:38:37,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 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 105 [2023-11-29 05:38:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:38:37,780 INFO L225 Difference]: With dead ends: 1815 [2023-11-29 05:38:37,780 INFO L226 Difference]: Without dead ends: 1815 [2023-11-29 05:38:37,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 05:38:37,780 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 921 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 6610 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 6610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:38:37,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 3073 Invalid, 6621 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 6610 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2023-11-29 05:38:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2023-11-29 05:38:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1273. [2023-11-29 05:38:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 779 states have (on average 1.7997432605905006) internal successors, (1402), 1261 states have internal predecessors, (1402), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:38:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1428 transitions. [2023-11-29 05:38:37,798 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1428 transitions. Word has length 105 [2023-11-29 05:38:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:38:37,798 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1428 transitions. [2023-11-29 05:38:37,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 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 05:38:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1428 transitions. [2023-11-29 05:38:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:38:37,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:38:37,799 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] [2023-11-29 05:38:37,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 05:38:38,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 (26)] Ended with exit code 0 [2023-11-29 05:38:38,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:38:38,200 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:38:38,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:38:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash 393686100, now seen corresponding path program 1 times [2023-11-29 05:38:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:38:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596613214] [2023-11-29 05:38:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:38,201 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 05:38:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:38:38,202 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:38:38,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Waiting until timeout for monitored process [2023-11-29 05:38:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:39,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 05:38:39,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:39,138 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 05:38:39,279 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:38:39,279 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 05:38:39,319 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 05:38:39,415 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 05:38:40,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:38:40,273 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 05:38:40,383 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:38:40,383 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 05:38:40,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:38:40,470 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 05:38:40,482 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 05:38:40,518 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 05:38:40,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:44,640 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5636 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 05:38:44,653 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5636 (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$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5635))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5636)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:38:44,670 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5636 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5635))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5636)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:38:45,078 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5682 (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$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5682))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5635)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5636)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:38:45,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:38:45,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596613214] [2023-11-29 05:38:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596613214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:45,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2046461365] [2023-11-29 05:38:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:38:45,082 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:38:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:38:45,083 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:38:45,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 05:38:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:38:49,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 05:38:49,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:38:49,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 05:38:50,120 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:38:50,120 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 05:38:50,174 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 05:38:50,818 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:38:50,819 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 36 treesize of output 35 [2023-11-29 05:38:50,960 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:38:50,960 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 36 treesize of output 35 [2023-11-29 05:38:51,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:38:51,055 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 36 treesize of output 35 [2023-11-29 05:38:51,066 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 27 treesize of output 15 [2023-11-29 05:38:51,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 05:38:51,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:38:51,085 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6106 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6106) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:38:51,097 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6106 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6106) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:38:51,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6106 (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$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6105))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6106)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:38:51,124 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6106 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6105))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6106)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:38:51,553 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 05:38:51,553 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 05:38:51,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6105 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6106 (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 (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6152))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6105)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6106)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 05:38:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2046461365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:38:51,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:38:51,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2023-11-29 05:38:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914075845] [2023-11-29 05:38:51,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:38:51,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 05:38:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:38:51,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 05:38:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=484, Unknown=12, NotChecked=468, Total=1056 [2023-11-29 05:38:51,569 INFO L87 Difference]: Start difference. First operand 1273 states and 1428 transitions. Second operand has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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 05:39:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:39:11,122 INFO L93 Difference]: Finished difference Result 2023 states and 2211 transitions. [2023-11-29 05:39:11,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:39:11,122 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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 107 [2023-11-29 05:39:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:39:11,126 INFO L225 Difference]: With dead ends: 2023 [2023-11-29 05:39:11,126 INFO L226 Difference]: Without dead ends: 2023 [2023-11-29 05:39:11,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=163, Invalid=853, Unknown=12, NotChecked=612, Total=1640 [2023-11-29 05:39:11,127 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 1545 mSDsluCounter, 7135 mSDsCounter, 0 mSdLazyCounter, 9263 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 7651 SdHoareTripleChecker+Invalid, 9304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 9263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:39:11,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 7651 Invalid, 9304 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 9263 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2023-11-29 05:39:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2023-11-29 05:39:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1272. [2023-11-29 05:39:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 779 states have (on average 1.7984595635430038) internal successors, (1401), 1260 states have internal predecessors, (1401), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:39:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1427 transitions. [2023-11-29 05:39:11,141 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1427 transitions. Word has length 107 [2023-11-29 05:39:11,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:39:11,141 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1427 transitions. [2023-11-29 05:39:11,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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 05:39:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1427 transitions. [2023-11-29 05:39:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 05:39:11,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:39:11,142 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] [2023-11-29 05:39:11,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Ended with exit code 0 [2023-11-29 05:39:11,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-29 05:39:11,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:39:11,543 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:39:11,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:39:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash 393686101, now seen corresponding path program 1 times [2023-11-29 05:39:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:39:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580578620] [2023-11-29 05:39:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:11,544 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 05:39:11,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:39:11,545 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:39:11,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Waiting until timeout for monitored process [2023-11-29 05:39:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:12,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 05:39:12,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:12,486 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 05:39:12,755 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 05:39:12,772 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:39:12,772 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 05:39:12,802 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 05:39:12,811 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 05:39:12,906 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 05:39:12,910 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 05:39:13,544 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:39:13,545 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 05:39:13,552 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 05:39:13,665 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:39:13,666 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 05:39:13,675 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 05:39:13,751 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:39:13,752 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 05:39:13,762 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 05:39:13,777 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 05:39:13,781 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 05:39:13,809 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 05:39:13,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:13,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 05:39:14,023 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_6624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:39:14,216 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6621) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6622) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6622))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6621) .cse2 v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:39:14,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_6622))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_6621) .cse1 v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_6621) (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_6622) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 05:39:16,296 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6715))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6622))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6716) .cse0 v_ArrVal_6621) .cse1 v_ArrVal_6623) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6622 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6623 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6715))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6716) .cse6 v_ArrVal_6621) (select (select (store .cse7 .cse6 v_ArrVal_6622) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6623))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2023-11-29 05:39:16,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:39:16,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580578620] [2023-11-29 05:39:16,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580578620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:16,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1710330948] [2023-11-29 05:39:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:39:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:39:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:39:16,309 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:39:16,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 05:39:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:39:42,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 05:39:42,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:39:42,850 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 05:39:43,269 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 05:39:43,294 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:39:43,294 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 05:39:43,323 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 05:39:43,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 05:39:43,431 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 05:39:43,437 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 05:39:44,518 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:39:44,518 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 05:39:44,537 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 05:39:44,741 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 39 [2023-11-29 05:39:44,760 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 05:39:44,839 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:39:44,839 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 05:39:44,856 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 05:39:44,879 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 05:39:44,886 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 05:39:44,896 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 05:39:44,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:39:44,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:39:45,012 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_7188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:39:45,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base|)) (.cse2 (bvadd |c_ULTIMATE.start_main_#t~mem35#1.offset| (_ bv16 32)))) (and (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (_ BitVec 32)) (v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7186) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse1 .cse2 v_ArrVal_7187)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (_ BitVec 32)) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store .cse1 .cse2 v_ArrVal_7187)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7186) .cse4 v_ArrVal_7189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_7188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) is different from false [2023-11-29 05:39:47,287 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (_ BitVec 32)) (v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7281))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse1 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7280))) (store (store .cse1 .cse2 v_ArrVal_7186) (select (select (store .cse3 .cse2 (store (select .cse3 .cse2) (bvadd (_ bv16 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) v_ArrVal_7187)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7189))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7187 (_ BitVec 32)) (v_ArrVal_7188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7281))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7280))) (let ((.cse8 (store .cse9 .cse6 (store (select .cse9 .cse6) (bvadd (_ bv16 32) (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) v_ArrVal_7187)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store .cse5 .cse6 v_ArrVal_7186) .cse7 v_ArrVal_7189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_7188) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 05:39:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1710330948] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:39:47,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:39:47,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2023-11-29 05:39:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166225552] [2023-11-29 05:39:47,491 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:39:47,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:39:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:39:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:39:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=173, Unknown=11, NotChecked=306, Total=552 [2023-11-29 05:39:47,492 INFO L87 Difference]: Start difference. First operand 1272 states and 1427 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 05:40:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:40:11,599 INFO L93 Difference]: Finished difference Result 1813 states and 1967 transitions. [2023-11-29 05:40:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:40:11,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 107 [2023-11-29 05:40:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:40:11,603 INFO L225 Difference]: With dead ends: 1813 [2023-11-29 05:40:11,603 INFO L226 Difference]: Without dead ends: 1813 [2023-11-29 05:40:11,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 203 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=106, Invalid=339, Unknown=11, NotChecked=414, Total=870 [2023-11-29 05:40:11,604 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 916 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 6601 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 6611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 6601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:40:11,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 3080 Invalid, 6611 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 6601 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2023-11-29 05:40:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-11-29 05:40:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1271. [2023-11-29 05:40:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 779 states have (on average 1.797175866495507) internal successors, (1400), 1259 states have internal predecessors, (1400), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:40:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1426 transitions. [2023-11-29 05:40:11,618 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1426 transitions. Word has length 107 [2023-11-29 05:40:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:40:11,618 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1426 transitions. [2023-11-29 05:40:11,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 05:40:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1426 transitions. [2023-11-29 05:40:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:40:11,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:40:11,619 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] [2023-11-29 05:40:11,628 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Ended with exit code 0 [2023-11-29 05:40:11,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 05:40:12,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:40:12,020 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:40:12,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:40:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash 377166261, now seen corresponding path program 1 times [2023-11-29 05:40:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:40:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022270673] [2023-11-29 05:40:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:12,021 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 05:40:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:40:12,022 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:40:12,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 (32)] Waiting until timeout for monitored process [2023-11-29 05:40:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:13,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 05:40:13,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:13,159 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 05:40:13,410 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:40:13,410 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 05:40:13,470 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 05:40:13,632 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 05:40:15,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:40:15,015 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 05:40:15,200 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:40:15,201 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 05:40:15,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:40:15,337 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 05:40:15,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:40:15,494 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 05:40:15,519 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 05:40:15,588 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 05:40:15,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:40:15,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7721) |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 05:40:15,718 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7721) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 05:40:15,740 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7720 (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$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7720))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7721)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:40:15,763 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7720 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7720))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7721)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:40:15,787 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7720 (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 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7719))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7720)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7721)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:40:15,815 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7720 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7719))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7720)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7721)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:40:16,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7721 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7720 (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 (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7767))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7719)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7720)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7721)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:40:16,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:40:16,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022270673] [2023-11-29 05:40:16,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022270673] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:16,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [696362623] [2023-11-29 05:40:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:40:16,323 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:40:16,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:40:16,324 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:40:16,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 05:40:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:40:47,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 05:40:47,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:40:47,186 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 05:40:47,725 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:40:47,725 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 05:40:47,800 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 05:40:48,921 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:40:48,922 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 36 treesize of output 35 [2023-11-29 05:40:49,179 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:40:49,179 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 36 treesize of output 35 [2023-11-29 05:40:49,354 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:40:49,355 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 36 treesize of output 35 [2023-11-29 05:40:49,528 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:40:49,529 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 36 treesize of output 35 [2023-11-29 05:40:49,545 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 27 treesize of output 15 [2023-11-29 05:40:49,551 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 05:40:49,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:40:49,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8207) |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 05:40:49,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:40:49,617 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (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 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8206))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:40:49,639 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:40:49,663 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (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 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8205))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:40:49,690 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (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 (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8205))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:40:50,289 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 05:40:50,289 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 05:40:50,310 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (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 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8253))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8205)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 05:40:50,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [696362623] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:40:50,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:40:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2023-11-29 05:40:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935590601] [2023-11-29 05:40:50,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:40:50,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 05:40:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:40:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 05:40:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=534, Unknown=14, NotChecked=826, Total=1482 [2023-11-29 05:40:50,318 INFO L87 Difference]: Start difference. First operand 1271 states and 1426 transitions. Second operand has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 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 05:41:26,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:41:26,281 INFO L93 Difference]: Finished difference Result 2021 states and 2209 transitions. [2023-11-29 05:41:26,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:41:26,281 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 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 109 [2023-11-29 05:41:26,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:41:26,284 INFO L225 Difference]: With dead ends: 2021 [2023-11-29 05:41:26,284 INFO L226 Difference]: Without dead ends: 2021 [2023-11-29 05:41:26,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=189, Invalid=975, Unknown=14, NotChecked=1078, Total=2256 [2023-11-29 05:41:26,285 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 2447 mSDsluCounter, 8386 mSDsCounter, 0 mSdLazyCounter, 10907 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 8901 SdHoareTripleChecker+Invalid, 10967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 10907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:41:26,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 8901 Invalid, 10967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 10907 Invalid, 0 Unknown, 0 Unchecked, 35.0s Time] [2023-11-29 05:41:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2023-11-29 05:41:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1270. [2023-11-29 05:41:26,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 779 states have (on average 1.7958921694480103) internal successors, (1399), 1258 states have internal predecessors, (1399), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 05:41:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1425 transitions. [2023-11-29 05:41:26,298 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1425 transitions. Word has length 109 [2023-11-29 05:41:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:41:26,298 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1425 transitions. [2023-11-29 05:41:26,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 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 05:41:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1425 transitions. [2023-11-29 05:41:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 05:41:26,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:41:26,299 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] [2023-11-29 05:41:26,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 (32)] Ended with exit code 0 [2023-11-29 05:41:26,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 05:41:26,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 05:41:26,699 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 05:41:26,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:41:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash 377166262, now seen corresponding path program 1 times [2023-11-29 05:41:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:41:26,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663227994] [2023-11-29 05:41:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:26,700 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 05:41:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:41:26,701 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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 05:41:26,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/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)] Waiting until timeout for monitored process [2023-11-29 05:41:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:41:28,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 05:41:28,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:41:28,127 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 05:41:28,381 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:41:28,381 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 05:41:28,398 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 05:41:28,456 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 05:41:28,472 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 05:41:28,657 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 05:41:28,664 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 05:41:29,920 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:41:29,920 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 05:41:29,935 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 05:41:30,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:41:30,139 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 05:41:30,163 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 05:41:30,332 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:41:30,332 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 05:41:30,348 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 05:41:30,523 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 05:41:30,523 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 05:41:30,540 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 05:41:30,567 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 05:41:30,580 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 05:41:30,646 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 05:41:30,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:41:30,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:41:30,937 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_8741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 05:41:31,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8740))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8739) .cse0 v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8739) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8742) |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 05:41:31,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_8740))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8739) .cse1 v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_8739) (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_8740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 05:41:33,470 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8738))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8740))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8737) .cse0 v_ArrVal_8739) .cse1 v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8738))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8737) .cse6 v_ArrVal_8739) (select (select (store .cse7 .cse6 v_ArrVal_8740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8742))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 05:41:47,944 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8834))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8738))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8740))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8833) .cse0 v_ArrVal_8737) .cse1 v_ArrVal_8739) .cse2 v_ArrVal_8742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8740 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8834))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8738))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8833) .cse8 v_ArrVal_8737) .cse9 v_ArrVal_8739) (select (select (store .cse10 .cse9 v_ArrVal_8740) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8742))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 05:41:47,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:41:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663227994] [2023-11-29 05:41:47,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663227994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:41:47,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2043567698] [2023-11-29 05:41:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:41:47,979 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 05:41:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 05:41:47,980 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 05:41:47,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_866d9bdc-3da8-45f8-9b96-783a39017597/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 05:42:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:42:47,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 05:42:47,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:42:47,517 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 05:42:50,024 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 05:42:50,220 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:42:50,221 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 05:42:50,669 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 05:42:50,772 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 05:42:52,021 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 05:42:52,048 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 05:42:56,894 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:42:56,894 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 05:42:56,943 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 05:42:58,119 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:42:58,119 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 05:42:58,171 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 05:42:58,898 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:42:58,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 50 treesize of output 45 [2023-11-29 05:42:58,925 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 05:42:59,936 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 05:42:59,936 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 05:42:59,999 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 05:43:00,137 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 05:43:00,198 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 05:43:00,231 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 05:43:00,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:43:00,477 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9322 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 05:43:00,610 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9322 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_9322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 05:43:00,904 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9321) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9320) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9320))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9321) .cse2 v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 05:43:01,335 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_9321) (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_9320) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_9320))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_9321) .cse3 v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 05:43:02,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9318))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9319) .cse1 v_ArrVal_9321) (select (select (store .cse2 .cse1 v_ArrVal_9320) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9323))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9318))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9320))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9319) .cse4 v_ArrVal_9321) .cse5 v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 05:43:04,407 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_9318))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9320))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_9319) .cse1 v_ArrVal_9321) .cse2 v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_9318))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_9319) .cse7 v_ArrVal_9321) (select (select (store .cse8 .cse7 v_ArrVal_9320) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9323))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 05:43:12,570 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9415))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9318))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9320))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9414) .cse0 v_ArrVal_9319) .cse1 v_ArrVal_9321) .cse2 v_ArrVal_9323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9319 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9323 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9415))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9318))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9414) .cse8 v_ArrVal_9319) .cse9 v_ArrVal_9321) (select (select (store .cse10 .cse9 v_ArrVal_9320) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9323))))) |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 05:43:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2043567698] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:43:12,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:43:12,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 05:43:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870808362] [2023-11-29 05:43:12,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:43:12,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:43:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:43:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:43:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=390, Unknown=16, NotChecked=676, Total=1190 [2023-11-29 05:43:12,617 INFO L87 Difference]: Start difference. First operand 1270 states and 1425 transitions. Second operand has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 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)