./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:38:45,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:38:45,618 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:38:45,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:38:45,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:38:45,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:38:45,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:38:45,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:38:45,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:38:45,645 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:38:45,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:38:45,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:38:45,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:38:45,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:38:45,648 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:38:45,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:38:45,649 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:38:45,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:38:45,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:38:45,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:38:45,651 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:38:45,652 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:38:45,652 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:38:45,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:38:45,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:38:45,654 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:38:45,654 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:38:45,655 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:38:45,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:38:45,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:38:45,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:38:45,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:38:45,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:38:45,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:38:45,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:38:45,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:38:45,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:38:45,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:38:45,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:38:45,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:38:45,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:38:45,659 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_6060cb2c-d448-4be6-89d1-2062e6b0959f/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_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2023-11-29 06:38:45,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:38:45,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:38:45,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:38:45,898 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:38:45,899 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:38:45,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2023-11-29 06:38:48,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:38:48,952 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:38:48,952 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2023-11-29 06:38:48,971 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data/5420e29a5/19f76d14767247478cf54fcd1821e853/FLAGbadb0ead4 [2023-11-29 06:38:48,985 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data/5420e29a5/19f76d14767247478cf54fcd1821e853 [2023-11-29 06:38:48,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:38:48,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:38:48,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:38:48,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:38:48,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:38:48,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:38:48" (1/1) ... [2023-11-29 06:38:48,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1d8cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:48, skipping insertion in model container [2023-11-29 06:38:48,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:38:48" (1/1) ... [2023-11-29 06:38:49,064 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:38:49,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:38:49,607 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 06:38:49,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@122937e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:49, skipping insertion in model container [2023-11-29 06:38:49,608 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:38:49,608 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 06:38:49,610 INFO L158 Benchmark]: Toolchain (without parser) took 620.23ms. Allocated memory is still 163.6MB. Free memory was 114.0MB in the beginning and 91.3MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 06:38:49,611 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:38:49,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.66ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 91.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 06:38:49,613 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.15ms. Allocated memory is still 163.6MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 617.66ms. Allocated memory is still 163.6MB. Free memory was 113.7MB in the beginning and 91.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. 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_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:38:51,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:38:51,387 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 06:38:51,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:38:51,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:38:51,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:38:51,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:38:51,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:38:51,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:38:51,433 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:38:51,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:38:51,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:38:51,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:38:51,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:38:51,436 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:38:51,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:38:51,437 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:38:51,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:38:51,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:38:51,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:38:51,439 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:38:51,440 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:38:51,441 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:38:51,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:38:51,441 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:38:51,442 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:38:51,442 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:38:51,443 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:38:51,443 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:38:51,444 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:38:51,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:38:51,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:38:51,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:38:51,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:38:51,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:38:51,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:38:51,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:38:51,446 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:38:51,446 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:38:51,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:38:51,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:38:51,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:38:51,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:38:51,447 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:38:51,448 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_6060cb2c-d448-4be6-89d1-2062e6b0959f/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_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2023-11-29 06:38:51,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:38:51,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:38:51,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:38:51,749 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:38:51,750 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:38:51,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2023-11-29 06:38:54,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:38:54,841 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:38:54,841 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2023-11-29 06:38:54,859 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data/037120364/f53d4a4149c54f5f8ae5f50ffad2b7f2/FLAG79f8be9e6 [2023-11-29 06:38:54,872 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/data/037120364/f53d4a4149c54f5f8ae5f50ffad2b7f2 [2023-11-29 06:38:54,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:38:54,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:38:54,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:38:54,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:38:54,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:38:54,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:38:54" (1/1) ... [2023-11-29 06:38:54,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d829ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:54, skipping insertion in model container [2023-11-29 06:38:54,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:38:54" (1/1) ... [2023-11-29 06:38:54,966 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:38:55,424 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:38:55,438 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 06:38:55,452 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:38:55,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:38:55,538 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:38:55,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:38:55,667 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:38:55,675 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:38:55,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55 WrapperNode [2023-11-29 06:38:55,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:38:55,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:38:55,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:38:55,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:38:55,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,804 INFO L138 Inliner]: procedures = 180, calls = 390, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1418 [2023-11-29 06:38:55,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:38:55,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:38:55,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:38:55,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:38:55,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,934 INFO L175 MemorySlicer]: Split 359 memory accesses to 5 slices as follows [2, 323, 24, 5, 5]. 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, 82, 1, 1, 1]. [2023-11-29 06:38:55,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,935 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:55,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:56,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:56,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:38:56,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:38:56,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:38:56,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:38:56,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (1/1) ... [2023-11-29 06:38:56,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:38:56,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:38:56,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:38:56,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:38:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 06:38:56,111 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 06:38:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 06:38:56,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 06:38:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 06:38:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 06:38:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 06:38:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 06:38:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 06:38:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 06:38:56,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 06:38:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 06:38:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 06:38:56,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 06:38:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 06:38:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 06:38:56,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 06:38:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 06:38:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-29 06:38:56,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 06:38:56,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 06:38:56,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 06:38:56,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 06:38:56,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-29 06:38:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:38:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:38:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:38:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:38:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:38:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 06:38:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 06:38:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:38:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 06:38:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:38:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:38:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:38:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 06:38:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 06:38:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:38:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:38:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:38:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:38:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:38:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 06:38:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:38:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:38:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:38:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:38:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 06:38:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:38:56,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:38:56,353 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:38:56,355 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:38:56,374 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:38:56,412 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:38:56,434 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:38:56,457 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:38:56,477 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:39:01,976 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:39:02,193 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:39:02,194 INFO L309 CfgBuilder]: Removed 83 assume(true) statements. [2023-11-29 06:39:02,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:02 BoogieIcfgContainer [2023-11-29 06:39:02,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:39:02,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:39:02,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:39:02,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:39:02,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:38:54" (1/3) ... [2023-11-29 06:39:02,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618802d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:39:02, skipping insertion in model container [2023-11-29 06:39:02,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:38:55" (2/3) ... [2023-11-29 06:39:02,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618802d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:39:02, skipping insertion in model container [2023-11-29 06:39:02,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:39:02" (3/3) ... [2023-11-29 06:39:02,203 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2023-11-29 06:39:02,222 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:39:02,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 728 error locations. [2023-11-29 06:39:02,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:39:02,294 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;@405e4c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:39:02,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 728 error locations. [2023-11-29 06:39:02,303 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 06:39:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 06:39:02,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:02,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 06:39:02,311 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 06:39:02,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:02,316 INFO L85 PathProgramCache]: Analyzing trace with hash 70757696, now seen corresponding path program 1 times [2023-11-29 06:39:02,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:02,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631460403] [2023-11-29 06:39:02,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:02,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 06:39:02,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:02,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:02,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:02,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 06:39:02,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:02,604 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 06:39:02,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:02,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631460403] [2023-11-29 06:39:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631460403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:39:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627905998] [2023-11-29 06:39:02,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:02,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:39:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:39:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:39:02,646 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 06:39:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:03,533 INFO L93 Difference]: Finished difference Result 1304 states and 1386 transitions. [2023-11-29 06:39:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:39:03,536 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 06:39:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:03,556 INFO L225 Difference]: With dead ends: 1304 [2023-11-29 06:39:03,557 INFO L226 Difference]: Without dead ends: 1303 [2023-11-29 06:39:03,558 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 06:39:03,561 INFO L413 NwaCegarLoop]: 1242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:03,561 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.8s Time] [2023-11-29 06:39:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2023-11-29 06:39:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2023-11-29 06:39:03,645 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 06:39:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1385 transitions. [2023-11-29 06:39:03,652 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1385 transitions. Word has length 4 [2023-11-29 06:39:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:03,652 INFO L495 AbstractCegarLoop]: Abstraction has 1303 states and 1385 transitions. [2023-11-29 06:39:03,652 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 06:39:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1385 transitions. [2023-11-29 06:39:03,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 06:39:03,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:03,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 06:39:03,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:03,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:03,854 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 06:39:03,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash 70757758, now seen corresponding path program 1 times [2023-11-29 06:39:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262183197] [2023-11-29 06:39:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:03,855 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 06:39:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:03,857 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:03,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:04,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:39:04,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:04,076 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 06:39:04,090 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 06:39:04,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:04,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:04,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262183197] [2023-11-29 06:39:04,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262183197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:04,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:04,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:39:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651064692] [2023-11-29 06:39:04,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:04,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:39:04,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:04,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:39:04,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:39:04,095 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 06:39:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:06,901 INFO L93 Difference]: Finished difference Result 1532 states and 1658 transitions. [2023-11-29 06:39:06,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:39:06,902 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 06:39:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:06,911 INFO L225 Difference]: With dead ends: 1532 [2023-11-29 06:39:06,911 INFO L226 Difference]: Without dead ends: 1532 [2023-11-29 06:39:06,911 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 06:39:06,913 INFO L413 NwaCegarLoop]: 778 mSDtfsCounter, 1235 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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 06:39:06,913 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 06:39:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2023-11-29 06:39:06,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1278. [2023-11-29 06:39:06,949 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 06:39:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1419 transitions. [2023-11-29 06:39:06,956 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1419 transitions. Word has length 4 [2023-11-29 06:39:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:06,957 INFO L495 AbstractCegarLoop]: Abstraction has 1278 states and 1419 transitions. [2023-11-29 06:39:06,957 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 06:39:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1419 transitions. [2023-11-29 06:39:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 06:39:06,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:06,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 06:39:06,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:07,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:07,160 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 06:39:07,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:07,160 INFO L85 PathProgramCache]: Analyzing trace with hash 70757759, now seen corresponding path program 1 times [2023-11-29 06:39:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255028274] [2023-11-29 06:39:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:07,161 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 06:39:07,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:07,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:07,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:07,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:39:07,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:07,257 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 06:39:07,279 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 06:39:07,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:07,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:07,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255028274] [2023-11-29 06:39:07,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255028274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:07,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:07,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:39:07,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431900136] [2023-11-29 06:39:07,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:07,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:39:07,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:07,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:39:07,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:39:07,282 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 06:39:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:11,422 INFO L93 Difference]: Finished difference Result 1749 states and 1940 transitions. [2023-11-29 06:39:11,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:39:11,423 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 06:39:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:11,430 INFO L225 Difference]: With dead ends: 1749 [2023-11-29 06:39:11,430 INFO L226 Difference]: Without dead ends: 1749 [2023-11-29 06:39:11,431 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 06:39:11,432 INFO L413 NwaCegarLoop]: 1107 mSDtfsCounter, 675 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:11,432 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.1s Time] [2023-11-29 06:39:11,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2023-11-29 06:39:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1401. [2023-11-29 06:39:11,478 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 06:39:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1692 transitions. [2023-11-29 06:39:11,484 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1692 transitions. Word has length 4 [2023-11-29 06:39:11,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:11,485 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1692 transitions. [2023-11-29 06:39:11,485 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 06:39:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1692 transitions. [2023-11-29 06:39:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:39:11,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:11,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:39:11,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:11,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:11,686 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 06:39:11,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2099785487, now seen corresponding path program 1 times [2023-11-29 06:39:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:11,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748393959] [2023-11-29 06:39:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:11,688 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 06:39:11,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:11,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:11,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:11,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:39:11,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:11,794 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 06:39:11,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:11,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:11,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748393959] [2023-11-29 06:39:11,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748393959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:11,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:11,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:39:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887418455] [2023-11-29 06:39:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:11,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:39:11,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:39:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:39:11,797 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 06:39:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:13,439 INFO L93 Difference]: Finished difference Result 2786 states and 3368 transitions. [2023-11-29 06:39:13,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:39:13,441 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 06:39:13,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:13,452 INFO L225 Difference]: With dead ends: 2786 [2023-11-29 06:39:13,453 INFO L226 Difference]: Without dead ends: 2786 [2023-11-29 06:39:13,453 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 06:39:13,454 INFO L413 NwaCegarLoop]: 1134 mSDtfsCounter, 1243 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:13,454 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.6s Time] [2023-11-29 06:39:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2023-11-29 06:39:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1403. [2023-11-29 06:39:13,494 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 06:39:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1694 transitions. [2023-11-29 06:39:13,500 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1694 transitions. Word has length 5 [2023-11-29 06:39:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:13,500 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1694 transitions. [2023-11-29 06:39:13,501 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 06:39:13,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1694 transitions. [2023-11-29 06:39:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:39:13,501 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:13,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:13,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 06:39:13,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:13,704 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 06:39:13,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1404939320, now seen corresponding path program 1 times [2023-11-29 06:39:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32426199] [2023-11-29 06:39:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:13,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 06:39:13,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:13,706 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:13,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:13,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:39:13,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:13,880 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 06:39:13,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:13,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:13,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32426199] [2023-11-29 06:39:13,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32426199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:13,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:39:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090232628] [2023-11-29 06:39:13,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:13,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:39:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:13,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:39:13,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:39:13,882 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 06:39:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:14,934 INFO L93 Difference]: Finished difference Result 1364 states and 1654 transitions. [2023-11-29 06:39:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:39:14,936 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 06:39:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:14,941 INFO L225 Difference]: With dead ends: 1364 [2023-11-29 06:39:14,941 INFO L226 Difference]: Without dead ends: 1364 [2023-11-29 06:39:14,941 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 06:39:14,942 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 06:39:14,942 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 06:39:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-11-29 06:39:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2023-11-29 06:39:14,969 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 06:39:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1654 transitions. [2023-11-29 06:39:14,975 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1654 transitions. Word has length 10 [2023-11-29 06:39:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:14,976 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 1654 transitions. [2023-11-29 06:39:14,976 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 06:39:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1654 transitions. [2023-11-29 06:39:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 06:39:14,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:14,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:39:14,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 06:39:15,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:15,177 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 06:39:15,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1526958302, now seen corresponding path program 1 times [2023-11-29 06:39:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449535183] [2023-11-29 06:39:15,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:15,178 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 06:39:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:15,179 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:15,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:15,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:39:15,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:15,338 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 06:39:15,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:15,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449535183] [2023-11-29 06:39:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449535183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:15,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493280130] [2023-11-29 06:39:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:15,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:15,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:15,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:15,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:15,341 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 06:39:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:16,733 INFO L93 Difference]: Finished difference Result 1350 states and 1633 transitions. [2023-11-29 06:39:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:39:16,735 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 06:39:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:16,740 INFO L225 Difference]: With dead ends: 1350 [2023-11-29 06:39:16,740 INFO L226 Difference]: Without dead ends: 1350 [2023-11-29 06:39:16,740 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 06:39:16,741 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 58 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:16,741 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.4s Time] [2023-11-29 06:39:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2023-11-29 06:39:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1349. [2023-11-29 06:39:16,765 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 06:39:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1632 transitions. [2023-11-29 06:39:16,771 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1632 transitions. Word has length 12 [2023-11-29 06:39:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:16,771 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1632 transitions. [2023-11-29 06:39:16,772 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 06:39:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1632 transitions. [2023-11-29 06:39:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 06:39:16,773 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:16,773 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 06:39:16,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:16,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:16,973 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 06:39:16,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1678685040, now seen corresponding path program 1 times [2023-11-29 06:39:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728683122] [2023-11-29 06:39:16,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:16,974 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 06:39:16,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:16,975 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:16,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:17,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:39:17,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:17,137 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 06:39:17,206 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 06:39:17,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:17,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:17,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728683122] [2023-11-29 06:39:17,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728683122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:17,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:17,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:39:17,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908846742] [2023-11-29 06:39:17,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:17,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:17,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:17,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:17,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:17,209 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 06:39:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:20,381 INFO L93 Difference]: Finished difference Result 1600 states and 1868 transitions. [2023-11-29 06:39:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:39:20,382 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 06:39:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:20,389 INFO L225 Difference]: With dead ends: 1600 [2023-11-29 06:39:20,390 INFO L226 Difference]: Without dead ends: 1600 [2023-11-29 06:39:20,390 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 06:39:20,390 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 1170 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:20,391 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.1s Time] [2023-11-29 06:39:20,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2023-11-29 06:39:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1345. [2023-11-29 06:39:20,409 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 06:39:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1628 transitions. [2023-11-29 06:39:20,413 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1628 transitions. Word has length 26 [2023-11-29 06:39:20,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:20,414 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1628 transitions. [2023-11-29 06:39:20,414 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 06:39:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1628 transitions. [2023-11-29 06:39:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 06:39:20,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:20,415 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 06:39:20,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:20,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:20,616 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 06:39:20,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1678685039, now seen corresponding path program 1 times [2023-11-29 06:39:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050279780] [2023-11-29 06:39:20,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:20,617 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 06:39:20,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:20,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:20,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:20,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:39:20,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:20,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 06:39:20,928 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 06:39:20,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:20,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:20,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050279780] [2023-11-29 06:39:20,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050279780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:20,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:20,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:39:20,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78001324] [2023-11-29 06:39:20,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:20,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:20,930 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 06:39:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:25,927 INFO L93 Difference]: Finished difference Result 1690 states and 1873 transitions. [2023-11-29 06:39:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:39:25,928 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 06:39:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:25,935 INFO L225 Difference]: With dead ends: 1690 [2023-11-29 06:39:25,935 INFO L226 Difference]: Without dead ends: 1690 [2023-11-29 06:39:25,935 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 06:39:25,936 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 06:39:25,936 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 06:39:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2023-11-29 06:39:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1341. [2023-11-29 06:39:25,954 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 06:39:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1624 transitions. [2023-11-29 06:39:25,959 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1624 transitions. Word has length 26 [2023-11-29 06:39:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:25,959 INFO L495 AbstractCegarLoop]: Abstraction has 1341 states and 1624 transitions. [2023-11-29 06:39:25,960 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 06:39:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1624 transitions. [2023-11-29 06:39:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 06:39:25,961 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:25,961 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 06:39:25,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:26,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:26,162 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 06:39:26,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash -316092918, now seen corresponding path program 1 times [2023-11-29 06:39:26,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:26,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868877357] [2023-11-29 06:39:26,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:26,163 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 06:39:26,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:26,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:26,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:26,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:39:26,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:26,415 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 06:39:26,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:26,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868877357] [2023-11-29 06:39:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868877357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:26,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:26,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:26,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639094562] [2023-11-29 06:39:26,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:26,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:26,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:26,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:26,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:26,417 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 06:39:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:27,620 INFO L93 Difference]: Finished difference Result 1335 states and 1614 transitions. [2023-11-29 06:39:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:39:27,621 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 06:39:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:27,626 INFO L225 Difference]: With dead ends: 1335 [2023-11-29 06:39:27,626 INFO L226 Difference]: Without dead ends: 1335 [2023-11-29 06:39:27,627 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 06:39:27,627 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 06:39:27,627 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 06:39:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2023-11-29 06:39:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2023-11-29 06:39:27,644 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 06:39:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1614 transitions. [2023-11-29 06:39:27,649 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1614 transitions. Word has length 42 [2023-11-29 06:39:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:27,649 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1614 transitions. [2023-11-29 06:39:27,649 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 06:39:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1614 transitions. [2023-11-29 06:39:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 06:39:27,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:27,651 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 06:39:27,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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)] Ended with exit code 0 [2023-11-29 06:39:27,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:27,852 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 06:39:27,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:27,852 INFO L85 PathProgramCache]: Analyzing trace with hash -449345878, now seen corresponding path program 1 times [2023-11-29 06:39:27,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:27,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972793425] [2023-11-29 06:39:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:27,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 06:39:27,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:27,854 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:27,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:28,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:39:28,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:28,329 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 06:39:28,329 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:28,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972793425] [2023-11-29 06:39:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972793425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:28,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:39:28,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742008952] [2023-11-29 06:39:28,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:28,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:39:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:39:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:39:28,331 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 06:39:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:29,397 INFO L93 Difference]: Finished difference Result 1378 states and 1657 transitions. [2023-11-29 06:39:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:39:29,398 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 06:39:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:29,407 INFO L225 Difference]: With dead ends: 1378 [2023-11-29 06:39:29,407 INFO L226 Difference]: Without dead ends: 1378 [2023-11-29 06:39:29,407 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 06:39:29,408 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 06:39:29,408 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 06:39:29,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-11-29 06:39:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2023-11-29 06:39:29,429 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 06:39:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1657 transitions. [2023-11-29 06:39:29,434 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1657 transitions. Word has length 46 [2023-11-29 06:39:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:29,434 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1657 transitions. [2023-11-29 06:39:29,434 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 06:39:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1657 transitions. [2023-11-29 06:39:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 06:39:29,436 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:29,436 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 06:39:29,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 06:39:29,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:29,639 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 06:39:29,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:29,640 INFO L85 PathProgramCache]: Analyzing trace with hash 842573049, now seen corresponding path program 1 times [2023-11-29 06:39:29,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:29,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772896955] [2023-11-29 06:39:29,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:29,640 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 06:39:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:29,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:29,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:29,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:39:29,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:29,948 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 06:39:29,954 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 06:39:30,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:39:30,429 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 06:39:30,447 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:39:30,447 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 06:39:30,467 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 06:39:30,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:30,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:30,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772896955] [2023-11-29 06:39:30,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772896955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:30,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:30,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:39:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601598058] [2023-11-29 06:39:30,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:30,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:30,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:30,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:30,470 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 06:39:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:34,026 INFO L93 Difference]: Finished difference Result 1548 states and 1812 transitions. [2023-11-29 06:39:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:39:34,026 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 06:39:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:34,032 INFO L225 Difference]: With dead ends: 1548 [2023-11-29 06:39:34,033 INFO L226 Difference]: Without dead ends: 1548 [2023-11-29 06:39:34,033 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 06:39:34,033 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 1380 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s 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.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:34,033 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.5s Time] [2023-11-29 06:39:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2023-11-29 06:39:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1161. [2023-11-29 06:39:34,055 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 06:39:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1289 transitions. [2023-11-29 06:39:34,057 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1289 transitions. Word has length 49 [2023-11-29 06:39:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:34,057 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1289 transitions. [2023-11-29 06:39:34,057 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 06:39:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1289 transitions. [2023-11-29 06:39:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 06:39:34,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:34,059 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 06:39:34,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:34,260 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 06:39:34,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -604104386, now seen corresponding path program 1 times [2023-11-29 06:39:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279074694] [2023-11-29 06:39:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:34,261 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 06:39:34,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:34,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:34,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:34,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:39:34,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:34,498 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 06:39:34,511 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 06:39:34,529 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 06:39:34,537 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 06:39:34,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:34,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279074694] [2023-11-29 06:39:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279074694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226244835] [2023-11-29 06:39:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:34,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:39:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:34,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:39:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:39:34,539 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 06:39:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:38,178 INFO L93 Difference]: Finished difference Result 1160 states and 1288 transitions. [2023-11-29 06:39:38,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:39:38,179 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 06:39:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:38,183 INFO L225 Difference]: With dead ends: 1160 [2023-11-29 06:39:38,183 INFO L226 Difference]: Without dead ends: 1160 [2023-11-29 06:39:38,183 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 06:39:38,184 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.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:38,184 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.6s Time] [2023-11-29 06:39:38,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-11-29 06:39:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2023-11-29 06:39:38,195 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 06:39:38,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1288 transitions. [2023-11-29 06:39:38,197 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1288 transitions. Word has length 53 [2023-11-29 06:39:38,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:38,197 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1288 transitions. [2023-11-29 06:39:38,197 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 06:39:38,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1288 transitions. [2023-11-29 06:39:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 06:39:38,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:38,198 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 06:39:38,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:38,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:38,398 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 06:39:38,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:38,399 INFO L85 PathProgramCache]: Analyzing trace with hash -604104385, now seen corresponding path program 1 times [2023-11-29 06:39:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:38,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885250925] [2023-11-29 06:39:38,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:38,399 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 06:39:38,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:38,400 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:38,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:38,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 06:39:38,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:38,627 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 06:39:38,646 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 06:39:38,655 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 06:39:38,696 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 06:39:38,718 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 06:39:38,718 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:38,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:38,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885250925] [2023-11-29 06:39:38,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885250925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:38,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:38,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:38,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787753559] [2023-11-29 06:39:38,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:38,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:39:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:39:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:39:38,720 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 06:39:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:43,080 INFO L93 Difference]: Finished difference Result 1159 states and 1287 transitions. [2023-11-29 06:39:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:39:43,081 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 06:39:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:43,086 INFO L225 Difference]: With dead ends: 1159 [2023-11-29 06:39:43,086 INFO L226 Difference]: Without dead ends: 1159 [2023-11-29 06:39:43,086 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 06:39:43,086 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 1 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:43,087 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.3s Time] [2023-11-29 06:39:43,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2023-11-29 06:39:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2023-11-29 06:39:43,108 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 06:39:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1287 transitions. [2023-11-29 06:39:43,110 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1287 transitions. Word has length 53 [2023-11-29 06:39:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:43,110 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1287 transitions. [2023-11-29 06:39:43,110 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 06:39:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1287 transitions. [2023-11-29 06:39:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 06:39:43,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:43,111 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 06:39:43,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:43,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:43,311 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 06:39:43,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:43,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1670098846, now seen corresponding path program 1 times [2023-11-29 06:39:43,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:43,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241684511] [2023-11-29 06:39:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:43,313 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 06:39:43,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:43,313 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:43,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:43,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:39:43,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:43,572 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 06:39:43,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:39:43,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:43,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241684511] [2023-11-29 06:39:43,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241684511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:39:43,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:39:43,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:39:43,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425451617] [2023-11-29 06:39:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:39:43,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:39:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:43,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:39:43,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:39:43,574 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 06:39:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:44,746 INFO L93 Difference]: Finished difference Result 1161 states and 1291 transitions. [2023-11-29 06:39:44,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:39:44,746 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 06:39:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:44,753 INFO L225 Difference]: With dead ends: 1161 [2023-11-29 06:39:44,753 INFO L226 Difference]: Without dead ends: 1161 [2023-11-29 06:39:44,753 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 06:39:44,754 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 1 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:39:44,754 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.1s Time] [2023-11-29 06:39:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2023-11-29 06:39:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2023-11-29 06:39:44,770 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 06:39:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1291 transitions. [2023-11-29 06:39:44,771 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1291 transitions. Word has length 59 [2023-11-29 06:39:44,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:44,772 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1291 transitions. [2023-11-29 06:39:44,772 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 06:39:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1291 transitions. [2023-11-29 06:39:44,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 06:39:44,772 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:44,772 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 06:39:44,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:44,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:44,973 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 06:39:44,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:44,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1887501131, now seen corresponding path program 1 times [2023-11-29 06:39:44,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:44,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870642474] [2023-11-29 06:39:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:39:44,974 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 06:39:44,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:44,975 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:44,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:39:45,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:39:45,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:45,241 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 06:39:45,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:45,298 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 06:39:45,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:45,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870642474] [2023-11-29 06:39:45,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870642474] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:39:45,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:39:45,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 06:39:45,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763554558] [2023-11-29 06:39:45,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:39:45,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:39:45,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:45,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:39:45,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:39:45,301 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 06:39:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:47,006 INFO L93 Difference]: Finished difference Result 1170 states and 1306 transitions. [2023-11-29 06:39:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:39:47,007 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 06:39:47,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:47,011 INFO L225 Difference]: With dead ends: 1170 [2023-11-29 06:39:47,011 INFO L226 Difference]: Without dead ends: 1170 [2023-11-29 06:39:47,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:39:47,012 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 06:39:47,012 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 06:39:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2023-11-29 06:39:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1169. [2023-11-29 06:39:47,028 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 06:39:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1304 transitions. [2023-11-29 06:39:47,031 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1304 transitions. Word has length 60 [2023-11-29 06:39:47,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:47,031 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1304 transitions. [2023-11-29 06:39:47,032 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 06:39:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1304 transitions. [2023-11-29 06:39:47,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 06:39:47,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:47,032 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 06:39:47,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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)] Ended with exit code 0 [2023-11-29 06:39:47,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:47,233 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 06:39:47,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1671974178, now seen corresponding path program 2 times [2023-11-29 06:39:47,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:47,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271071834] [2023-11-29 06:39:47,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:39:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:39:47,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:47,235 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:47,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:47,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:39:47,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:39:47,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:39:47,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:47,677 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 06:39:47,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:47,813 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 06:39:47,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271071834] [2023-11-29 06:39:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271071834] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:39:47,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:39:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 06:39:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797992274] [2023-11-29 06:39:47,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:39:47,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:39:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:47,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:39:47,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:39:47,816 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 06:39:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:50,433 INFO L93 Difference]: Finished difference Result 1184 states and 1330 transitions. [2023-11-29 06:39:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:39:50,434 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 06:39:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:50,439 INFO L225 Difference]: With dead ends: 1184 [2023-11-29 06:39:50,439 INFO L226 Difference]: Without dead ends: 1182 [2023-11-29 06:39:50,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:39:50,440 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 06:39:50,440 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 06:39:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-11-29 06:39:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1178. [2023-11-29 06:39:50,453 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 06:39:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1316 transitions. [2023-11-29 06:39:50,455 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1316 transitions. Word has length 63 [2023-11-29 06:39:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:50,455 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1316 transitions. [2023-11-29 06:39:50,456 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 06:39:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1316 transitions. [2023-11-29 06:39:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 06:39:50,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:50,456 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 06:39:50,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 06:39:50,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:50,657 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 06:39:50,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1810240578, now seen corresponding path program 3 times [2023-11-29 06:39:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248495] [2023-11-29 06:39:50,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:39:50,658 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 06:39:50,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:50,659 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:50,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:51,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 06:39:51,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:39:51,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:39:51,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:51,425 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 06:39:51,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:39:52,014 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 06:39:52,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:39:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248495] [2023-11-29 06:39:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248495] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:39:52,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:39:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 06:39:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642543009] [2023-11-29 06:39:52,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:39:52,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 06:39:52,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:39:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 06:39:52,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:39:52,017 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 06:39:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:39:58,986 INFO L93 Difference]: Finished difference Result 1208 states and 1380 transitions. [2023-11-29 06:39:58,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 06:39:58,987 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 06:39:58,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:39:58,992 INFO L225 Difference]: With dead ends: 1208 [2023-11-29 06:39:58,993 INFO L226 Difference]: Without dead ends: 1205 [2023-11-29 06:39:58,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 06:39:58,994 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 24 mSDsluCounter, 11706 mSDsCounter, 0 mSdLazyCounter, 2642 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s 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 06:39:58,994 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 06:39:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-11-29 06:39:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1196. [2023-11-29 06:39:59,009 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 06:39:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1339 transitions. [2023-11-29 06:39:59,011 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1339 transitions. Word has length 69 [2023-11-29 06:39:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:39:59,011 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1339 transitions. [2023-11-29 06:39:59,011 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 06:39:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1339 transitions. [2023-11-29 06:39:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 06:39:59,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:39:59,012 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 06:39:59,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 06:39:59,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:59,213 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 06:39:59,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:39:59,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1717967490, now seen corresponding path program 4 times [2023-11-29 06:39:59,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:39:59,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214769150] [2023-11-29 06:39:59,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:39:59,214 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 06:39:59,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:39:59,215 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:59,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:39:59,581 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:39:59,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:39:59,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:39:59,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:39:59,928 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 06:39:59,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:01,440 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 06:40:01,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:01,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214769150] [2023-11-29 06:40:01,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214769150] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:40:01,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:40:01,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 06:40:01,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062703027] [2023-11-29 06:40:01,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:40:01,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 06:40:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:40:01,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 06:40:01,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 06:40:01,443 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 06:40:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:40:17,726 INFO L93 Difference]: Finished difference Result 1253 states and 1449 transitions. [2023-11-29 06:40:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 06:40:17,726 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 06:40:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:40:17,731 INFO L225 Difference]: With dead ends: 1253 [2023-11-29 06:40:17,731 INFO L226 Difference]: Without dead ends: 1251 [2023-11-29 06:40:17,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 06:40:17,735 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 47 mSDsluCounter, 24446 mSDsCounter, 0 mSdLazyCounter, 6445 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s 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, 11.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:40:17,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 25426 Invalid, 6530 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 6445 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2023-11-29 06:40:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-11-29 06:40:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1230. [2023-11-29 06:40:17,766 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 06:40:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1385 transitions. [2023-11-29 06:40:17,769 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1385 transitions. Word has length 81 [2023-11-29 06:40:17,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:40:17,769 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1385 transitions. [2023-11-29 06:40:17,769 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 06:40:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1385 transitions. [2023-11-29 06:40:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 06:40:17,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:40:17,771 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 06:40:17,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 06:40:17,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:40:17,971 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 06:40:17,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:40:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 515345570, now seen corresponding path program 5 times [2023-11-29 06:40:17,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:40:17,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868397263] [2023-11-29 06:40:17,973 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:40:17,973 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 06:40:17,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:40:17,974 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:40:17,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:40:19,324 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:40:19,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:40:19,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 06:40:19,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:40:19,365 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 06:40:19,463 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:40:19,463 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 06:40:19,490 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 06:40:19,591 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 06:40:20,506 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:40:20,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:40:20,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 06:40:20,593 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 06:40:20,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:40:25,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:40:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868397263] [2023-11-29 06:40:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868397263] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:40:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1027962201] [2023-11-29 06:40:25,007 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:40:25,007 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:40:25,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:40:25,008 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:40:25,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 06:41:36,759 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:41:36,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:41:36,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 06:41:36,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:36,974 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 06:41:37,296 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:41:37,296 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 06:41:37,356 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 06:41:37,505 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 20 treesize of output 12 [2023-11-29 06:41:38,379 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:41:38,379 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 06:41:38,452 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 06:41:38,463 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 06:41:38,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:38,846 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2137) |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 06:41:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1027962201] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:38,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:41:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 06:41:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887307862] [2023-11-29 06:41:38,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:41:38,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:41:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:41:38,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:41:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2023-11-29 06:41:38,849 INFO L87 Difference]: Start difference. First operand 1230 states and 1385 transitions. Second operand has 13 states, 10 states have (on average 11.2) internal successors, (112), 13 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:41:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:41:49,320 INFO L93 Difference]: Finished difference Result 2028 states and 2216 transitions. [2023-11-29 06:41:49,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:41:49,321 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 11.2) internal successors, (112), 13 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 103 [2023-11-29 06:41:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:41:49,327 INFO L225 Difference]: With dead ends: 2028 [2023-11-29 06:41:49,327 INFO L226 Difference]: Without dead ends: 2026 [2023-11-29 06:41:49,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=210, Unknown=2, NotChecked=30, Total=306 [2023-11-29 06:41:49,328 INFO L413 NwaCegarLoop]: 530 mSDtfsCounter, 1532 mSDsluCounter, 3222 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 3752 SdHoareTripleChecker+Invalid, 4327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:41:49,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 3752 Invalid, 4327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4311 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 06:41:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2023-11-29 06:41:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1276. [2023-11-29 06:41:49,347 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 06:41:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1431 transitions. [2023-11-29 06:41:49,349 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1431 transitions. Word has length 103 [2023-11-29 06:41:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:41:49,349 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1431 transitions. [2023-11-29 06:41:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 11.2) internal successors, (112), 13 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:41:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1431 transitions. [2023-11-29 06:41:49,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 06:41:49,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:41:49,350 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 06:41:49,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 06:41:49,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:41:49,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:41:49,751 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 06:41:49,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:41:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 515345571, now seen corresponding path program 1 times [2023-11-29 06:41:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:41:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358615474] [2023-11-29 06:41:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:49,752 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 06:41:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:41:49,753 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:41:49,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:41:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:41:50,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 06:41:50,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:41:50,430 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 06:41:50,699 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 06:41:50,715 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:41:50,715 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 06:41:50,750 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 06:41:50,758 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 06:41:50,864 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 06:41:50,869 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 06:41:51,646 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:41:51,646 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 06:41:51,652 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 06:41:51,702 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 06:41:51,711 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 06:41:51,741 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 06:41:51,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:41:53,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2675 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2675) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 06:41:53,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:41:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358615474] [2023-11-29 06:41:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358615474] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:41:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2063779878] [2023-11-29 06:41:53,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:41:53,078 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:41:53,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:41:53,079 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:41:53,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 06:43:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 06:43:39,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:39,286 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 06:43:39,562 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:43:39,562 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 06:43:39,572 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 06:43:39,594 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 06:43:39,603 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 06:43:39,670 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 06:43:39,674 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 06:43:40,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:43:40,370 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 06:43:40,378 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 06:43:40,428 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 06:43:40,436 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 06:43:40,440 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 06:43:40,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:41,784 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3214 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3215 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3215) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 06:43:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2063779878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:41,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:43:41,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 06:43:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870175997] [2023-11-29 06:43:41,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:43:41,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:43:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:41,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:43:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 06:43:41,791 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 06:43:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:54,722 INFO L93 Difference]: Finished difference Result 1817 states and 1971 transitions. [2023-11-29 06:43:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:43:54,722 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 06:43:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:54,727 INFO L225 Difference]: With dead ends: 1817 [2023-11-29 06:43:54,727 INFO L226 Difference]: Without dead ends: 1817 [2023-11-29 06:43:54,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 06:43:54,727 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 923 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 5009 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 2470 SdHoareTripleChecker+Invalid, 5020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:54,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 2470 Invalid, 5020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5009 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2023-11-29 06:43:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2023-11-29 06:43:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1275. [2023-11-29 06:43:54,749 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 06:43:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1430 transitions. [2023-11-29 06:43:54,752 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1430 transitions. Word has length 103 [2023-11-29 06:43:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:54,752 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1430 transitions. [2023-11-29 06:43:54,752 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 06:43:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1430 transitions. [2023-11-29 06:43:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:43:54,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:54,754 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 06:43:54,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 06:43:54,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:43:55,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:43:55,157 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 06:43:55,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1327810062, now seen corresponding path program 1 times [2023-11-29 06:43:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:55,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926320172] [2023-11-29 06:43:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:55,158 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 06:43:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:55,159 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:43:55,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:43:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:55,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 06:43:55,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:55,934 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 06:43:56,041 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:43:56,042 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 06:43:56,076 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 06:43:56,162 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 06:43:57,036 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:43:57,037 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 06:43:57,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:43:57,138 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 06:43:57,152 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 06:43:57,192 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 06:43:57,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:57,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3624) |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 06:43:57,264 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3624 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3624) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:43:57,675 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3670 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3670))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3624)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:43:57,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926320172] [2023-11-29 06:43:57,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926320172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:57,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1760858028] [2023-11-29 06:43:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:57,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:43:57,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:43:57,679 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:43:57,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 06:43:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:59,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 06:43:59,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:59,608 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 06:43:59,909 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:43:59,909 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 06:43:59,975 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 06:44:00,117 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 20 treesize of output 12 [2023-11-29 06:44:01,012 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:44:01,012 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 06:44:01,166 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:44:01,167 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 06:44:01,185 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 06:44:01,197 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 06:44:01,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:44:05,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4079 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:44:05,718 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4079 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4125 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4125))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4079)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:44:05,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1760858028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:44:05,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:44:05,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 06:44:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319670168] [2023-11-29 06:44:05,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:44:05,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:44:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:44:05,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:44:05,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-29 06:44:05,723 INFO L87 Difference]: Start difference. First operand 1275 states and 1430 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:44:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:44:17,180 INFO L93 Difference]: Finished difference Result 2024 states and 2210 transitions. [2023-11-29 06:44:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:44:17,180 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-11-29 06:44:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:44:17,186 INFO L225 Difference]: With dead ends: 2024 [2023-11-29 06:44:17,186 INFO L226 Difference]: Without dead ends: 2024 [2023-11-29 06:44:17,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-29 06:44:17,187 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 1527 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 4342 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 3757 SdHoareTripleChecker+Invalid, 4357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:44:17,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 3757 Invalid, 4357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4342 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2023-11-29 06:44:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2023-11-29 06:44:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1274. [2023-11-29 06:44:17,210 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 06:44:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1429 transitions. [2023-11-29 06:44:17,212 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1429 transitions. Word has length 105 [2023-11-29 06:44:17,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:44:17,213 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1429 transitions. [2023-11-29 06:44:17,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:44:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1429 transitions. [2023-11-29 06:44:17,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:44:17,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:44:17,214 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 06:44:17,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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)] Forceful destruction successful, exit code 0 [2023-11-29 06:44:17,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 06:44:17,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:44:17,615 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 06:44:17,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1327810063, now seen corresponding path program 1 times [2023-11-29 06:44:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:17,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134538118] [2023-11-29 06:44:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:17,616 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 06:44:17,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:17,617 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:44:17,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:44:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:18,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 06:44:18,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:18,403 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 06:44:18,672 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:44:18,672 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 06:44:18,679 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 06:44:18,712 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 06:44:18,716 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 06:44:18,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 18 treesize of output 10 [2023-11-29 06:44:18,847 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 06:44:19,539 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:44:19,539 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 06:44:19,545 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 06:44:19,674 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:44:19,674 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 06:44:19,683 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 06:44:19,699 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 06:44:19,707 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 06:44:19,734 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 06:44:19,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:44:19,896 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:44:19,933 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-29 06:44:21,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4671 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4672) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4671 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4671))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4672) .cse2 v_ArrVal_4580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:44:21,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:44:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134538118] [2023-11-29 06:44:21,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134538118] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:44:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [594176082] [2023-11-29 06:44:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:21,304 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:44:21,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:44:21,305 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:44:21,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 06:46:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:05,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 06:46:05,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:46:05,255 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 06:46:05,513 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:46:05,514 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 06:46:05,521 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 06:46:05,536 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 06:46:05,542 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 06:46:05,592 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 06:46:05,597 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 06:46:06,276 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:06,277 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 06:46:06,283 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 06:46:06,353 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:06,353 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 06:46:06,360 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 06:46:06,381 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 06:46:06,389 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 06:46:06,391 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 06:46:06,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:46:06,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5127 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 06:46:06,477 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5127 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_5127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_5126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 06:46:07,779 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5219 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5127 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5219))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5218) .cse0 v_ArrVal_5126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5127) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5219 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5218) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5219) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 06:46:07,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [594176082] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:46:07,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:46:07,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 06:46:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410755502] [2023-11-29 06:46:07,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:46:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:46:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:46:07,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:46:07,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 06:46:07,790 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 06:46:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:46:20,648 INFO L93 Difference]: Finished difference Result 1815 states and 1969 transitions. [2023-11-29 06:46:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:46:20,649 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 06:46:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:46:20,653 INFO L225 Difference]: With dead ends: 1815 [2023-11-29 06:46:20,653 INFO L226 Difference]: Without dead ends: 1815 [2023-11-29 06:46:20,653 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 06:46:20,654 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 921 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 5008 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:46:20,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 2471 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5008 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2023-11-29 06:46:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2023-11-29 06:46:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1273. [2023-11-29 06:46:20,673 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 06:46:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1428 transitions. [2023-11-29 06:46:20,675 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1428 transitions. Word has length 105 [2023-11-29 06:46:20,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:46:20,675 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1428 transitions. [2023-11-29 06:46:20,675 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 06:46:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1428 transitions. [2023-11-29 06:46:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 06:46:20,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:46:20,676 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 06:46:20,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:46:20,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 06:46:21,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:46:21,077 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 06:46:21,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:46:21,077 INFO L85 PathProgramCache]: Analyzing trace with hash 422133460, now seen corresponding path program 1 times [2023-11-29 06:46:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:46:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988786482] [2023-11-29 06:46:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:46:21,078 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 06:46:21,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:46:21,079 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:46:21,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:46:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:22,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 06:46:22,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:46:22,097 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 06:46:22,242 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:46:22,242 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 06:46:22,275 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 06:46:22,384 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 06:46:23,299 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:46:23,299 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 06:46:23,417 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:46:23,417 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 06:46:23,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:46:23,505 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 06:46:23,522 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 06:46:23,563 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 06:46:23,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:46:27,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5644 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:46:27,712 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5644 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5643))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5644)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:46:27,726 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5644 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5643))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5644)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:46:28,106 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5644 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5690))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5643)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5644)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:46:28,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:46:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988786482] [2023-11-29 06:46:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988786482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:46:28,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1177139126] [2023-11-29 06:46:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:46:28,110 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:46:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:46:28,111 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:46:28,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 06:46:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:30,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 06:46:30,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:46:30,534 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 06:46:30,836 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:46:30,836 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 06:46:30,904 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 06:46:31,068 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 20 treesize of output 12 [2023-11-29 06:46:31,987 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:31,987 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 06:46:32,190 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:32,190 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 06:46:32,305 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:32,305 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 06:46:32,318 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 06:46:32,328 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 06:46:32,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:46:32,342 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6115) |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 06:46:32,354 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6115 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:46:32,367 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6115 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6114))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6115)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:46:32,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6115 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6114))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6115)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:46:32,777 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6115 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6161))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6114)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6115)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:46:32,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1177139126] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:46:32,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:46:32,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 06:46:32,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724644591] [2023-11-29 06:46:32,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:46:32,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 06:46:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:46:32,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 06:46:32,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=308, Unknown=11, NotChecked=396, Total=812 [2023-11-29 06:46:32,782 INFO L87 Difference]: Start difference. First operand 1273 states and 1428 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:46:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:46:42,099 INFO L93 Difference]: Finished difference Result 2022 states and 2208 transitions. [2023-11-29 06:46:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:46:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-11-29 06:46:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:46:42,103 INFO L225 Difference]: With dead ends: 2022 [2023-11-29 06:46:42,103 INFO L226 Difference]: Without dead ends: 2022 [2023-11-29 06:46:42,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=106, Invalid=339, Unknown=11, NotChecked=414, Total=870 [2023-11-29 06:46:42,103 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 2428 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 3567 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2446 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:46:42,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2446 Valid, 3022 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3567 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 06:46:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2023-11-29 06:46:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1272. [2023-11-29 06:46:42,118 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 06:46:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1427 transitions. [2023-11-29 06:46:42,120 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1427 transitions. Word has length 107 [2023-11-29 06:46:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:46:42,120 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1427 transitions. [2023-11-29 06:46:42,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:46:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1427 transitions. [2023-11-29 06:46:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 06:46:42,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:46:42,121 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 06:46:42,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 06:46:42,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:46:42,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:46:42,522 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 06:46:42,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:46:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash 422133461, now seen corresponding path program 1 times [2023-11-29 06:46:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:46:42,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469319749] [2023-11-29 06:46:42,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:46:42,523 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 06:46:42,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:46:42,524 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:46:42,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:46:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:46:43,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 06:46:43,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:46:43,501 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 06:46:43,824 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:46:43,824 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 06:46:43,834 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 06:46:43,865 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 06:46:43,876 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 06:46:43,994 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 06:46:43,998 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 06:46:44,701 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:44,702 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 06:46:44,707 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 06:46:44,830 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:44,830 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 06:46:44,837 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 06:46:44,933 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:46:44,933 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 06:46:44,941 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 06:46:44,959 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 06:46:44,963 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 06:46:44,996 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 06:46:44,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:46:45,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:46:45,192 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:46:45,231 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6631))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6630) .cse0 v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6630) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 06:46:45,287 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6630) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_6631))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6630) .cse3 v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 06:46:47,480 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6632 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6725))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6631))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6724) .cse0 v_ArrVal_6630) .cse1 v_ArrVal_6633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6725 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6633 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6725))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6724) .cse6 v_ArrVal_6630) (select (select (store .cse7 .cse6 v_ArrVal_6631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6633))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 06:46:47,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:46:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469319749] [2023-11-29 06:46:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469319749] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:46:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [722374528] [2023-11-29 06:46:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:46:47,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:46:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:46:47,495 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:46:47,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 06:47:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:01,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 06:47:01,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:47:01,760 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 06:47:02,189 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 06:47:02,217 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:47:02,218 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 06:47:02,246 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 06:47:02,257 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 06:47:02,340 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 06:47:02,346 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 06:47:03,374 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:47:03,374 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 06:47:03,388 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 06:47:03,511 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:47:03,511 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 06:47:03,518 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 06:47:03,607 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:47:03,607 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 06:47:03,618 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 06:47:03,637 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 06:47:03,643 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 06:47:03,653 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 06:47:03,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:47:03,719 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:47:03,759 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:47:03,890 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7194))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7195) .cse0 v_ArrVal_7197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7195) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 06:47:06,278 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7289))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7194))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7288) .cse0 v_ArrVal_7195) .cse1 v_ArrVal_7197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7289))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7288) .cse6 v_ArrVal_7195) (select (select (store .cse7 .cse6 v_ArrVal_7194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7197))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 06:47:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [722374528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:47:06,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:47:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 06:47:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631857650] [2023-11-29 06:47:06,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:47:06,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:47:06,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:47:06,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:47:06,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=146, Unknown=16, NotChecked=288, Total=506 [2023-11-29 06:47:06,295 INFO L87 Difference]: Start difference. First operand 1272 states and 1427 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 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 06:47:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:47:28,456 INFO L93 Difference]: Finished difference Result 1813 states and 1967 transitions. [2023-11-29 06:47:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:47:28,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 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 06:47:28,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:47:28,461 INFO L225 Difference]: With dead ends: 1813 [2023-11-29 06:47:28,461 INFO L226 Difference]: Without dead ends: 1813 [2023-11-29 06:47:28,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=99, Invalid=297, Unknown=20, NotChecked=396, Total=812 [2023-11-29 06:47:28,461 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 916 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 5803 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 5813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 5803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:47:28,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 2774 Invalid, 5813 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 5803 Invalid, 0 Unknown, 0 Unchecked, 21.3s Time] [2023-11-29 06:47:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-11-29 06:47:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1271. [2023-11-29 06:47:28,474 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 06:47:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1426 transitions. [2023-11-29 06:47:28,475 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1426 transitions. Word has length 107 [2023-11-29 06:47:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:47:28,476 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1426 transitions. [2023-11-29 06:47:28,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 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 06:47:28,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1426 transitions. [2023-11-29 06:47:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 06:47:28,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:47:28,476 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 06:47:28,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 06:47:28,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:47:28,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:47:28,877 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 06:47:28,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:47:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1945275445, now seen corresponding path program 1 times [2023-11-29 06:47:28,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:47:28,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451635241] [2023-11-29 06:47:28,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:28,878 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 06:47:28,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:47:28,879 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:47:28,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:47:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:29,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 06:47:29,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:47:29,983 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 06:47:30,199 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:47:30,199 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 06:47:30,241 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 06:47:30,399 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 06:47:31,734 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:47:31,734 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 06:47:31,903 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:47:31,904 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 06:47:32,041 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:47:32,042 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 06:47:32,183 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:47:32,184 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 06:47:32,203 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 06:47:32,272 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 06:47:32,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:47:32,386 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7730) |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 06:47:32,404 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7730 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 06:47:32,425 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7730 (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$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7729))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7730)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:47:32,446 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7730 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7729))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7730)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:47:32,471 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7730 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7728))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7729)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7730)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:47:32,498 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7730 (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7728))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7729)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7730)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:47:33,043 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7730 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7776))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7728)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7729)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7730)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:47:33,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:47:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451635241] [2023-11-29 06:47:33,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451635241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:47:33,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1725696818] [2023-11-29 06:47:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:47:33,049 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:47:33,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:47:33,050 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:47:33,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 06:47:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:47:39,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 06:47:39,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:47:39,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 7 [2023-11-29 06:47:40,309 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:47:40,310 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 06:47:40,413 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 06:47:40,683 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 20 treesize of output 12 [2023-11-29 06:47:41,940 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:47:41,940 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 06:47:42,226 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:47:42,226 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 06:47:42,403 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:47:42,403 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 06:47:42,592 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:47:42,593 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 06:47:42,628 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 06:47:42,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 06:47:42,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:47:42,674 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8218) |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 06:47:42,693 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8218 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8218) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:47:42,715 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8217 (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$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8217))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8218)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:47:42,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8217 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8218)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:47:42,761 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8216))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8218)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:47:42,787 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (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 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8216))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8218)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:47:43,308 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8264 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (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$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8264))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8216)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8218)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:47:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1725696818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:47:43,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:47:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 06:47:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841353664] [2023-11-29 06:47:43,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:47:43,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 06:47:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:47:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 06:47:43,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 06:47:43,317 INFO L87 Difference]: Start difference. First operand 1271 states and 1426 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) [2023-11-29 06:48:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:48:07,497 INFO L93 Difference]: Finished difference Result 2020 states and 2206 transitions. [2023-11-29 06:48:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:48:07,498 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 109 [2023-11-29 06:48:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:48:07,501 INFO L225 Difference]: With dead ends: 2020 [2023-11-29 06:48:07,501 INFO L226 Difference]: Without dead ends: 2020 [2023-11-29 06:48:07,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=379, Unknown=14, NotChecked=742, Total=1260 [2023-11-29 06:48:07,502 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 2418 mSDsluCounter, 5433 mSDsCounter, 0 mSdLazyCounter, 7093 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 5960 SdHoareTripleChecker+Invalid, 7126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 7093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:48:07,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 5960 Invalid, 7126 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [33 Valid, 7093 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2023-11-29 06:48:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2023-11-29 06:48:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1270. [2023-11-29 06:48:07,520 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 06:48:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1425 transitions. [2023-11-29 06:48:07,522 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1425 transitions. Word has length 109 [2023-11-29 06:48:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:48:07,522 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1425 transitions. [2023-11-29 06:48:07,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-11-29 06:48:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1425 transitions. [2023-11-29 06:48:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 06:48:07,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:48:07,522 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 06:48:07,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:48:07,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 06:48:07,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:48:07,923 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 06:48:07,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:48:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1945275446, now seen corresponding path program 1 times [2023-11-29 06:48:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:48:07,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935578234] [2023-11-29 06:48:07,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:07,924 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 06:48:07,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:48:07,925 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:48:07,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:48:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:09,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 06:48:09,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:48:09,062 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 06:48:09,505 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:48:09,506 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 06:48:09,515 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 06:48:09,558 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 06:48:09,568 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 06:48:09,750 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 06:48:09,755 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 06:48:10,717 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:10,718 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 06:48:10,729 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 06:48:10,899 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:10,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 06:48:10,910 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 06:48:11,041 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:11,041 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 06:48:11,053 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 06:48:11,206 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:11,206 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 06:48:11,217 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 06:48:11,239 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 06:48:11,245 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 06:48:11,294 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 06:48:11,294 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:48:11,510 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:48:11,556 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_8752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:48:11,603 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8750) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8751))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8750) .cse2 v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:48:11,661 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8751))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8750) .cse1 v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8750) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8753) |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 06:48:12,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8749))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8751))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8748) .cse0 v_ArrVal_8750) .cse1 v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8749))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8748) .cse6 v_ArrVal_8750) (select (select (store .cse7 .cse6 v_ArrVal_8751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8753))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 06:48:14,390 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_8749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8749))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8751))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8748) .cse1 v_ArrVal_8750) .cse2 v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8749))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8748) .cse7 v_ArrVal_8750) (select (select (store .cse8 .cse7 v_ArrVal_8751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8753))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 06:48:20,610 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8845))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8749))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8751))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8844) .cse0 v_ArrVal_8748) .cse1 v_ArrVal_8750) .cse2 v_ArrVal_8753) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8752) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8749 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8748 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8753 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8751 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8750 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8845))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8749))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8844) .cse8 v_ArrVal_8748) .cse9 v_ArrVal_8750) (select (select (store .cse10 .cse9 v_ArrVal_8751) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8753))))) |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 06:48:20,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:48:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935578234] [2023-11-29 06:48:20,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935578234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:48:20,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [37732855] [2023-11-29 06:48:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:48:20,651 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:48:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:48:20,652 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:48:20,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 06:48:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:48:39,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 06:48:39,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:48:39,078 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 06:48:41,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:48:41,773 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:48:41,773 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 06:48:41,918 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 06:48:42,004 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 06:48:42,440 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 06:48:42,469 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 06:48:48,036 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:48,036 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 06:48:48,093 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 06:48:48,693 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:48,694 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 06:48:48,752 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 06:48:49,130 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:49,131 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 06:48:49,192 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 06:48:49,605 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:48:49,605 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 06:48:49,635 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 06:48:49,778 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 06:48:49,808 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 06:48:49,864 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 06:48:49,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:48:50,128 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 06:48:50,257 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:48:50,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9331) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9332))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9331) .cse2 v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:48:50,765 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9331) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9332))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9331) .cse3 v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 06:49:00,293 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9330))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9332))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9329) .cse1 v_ArrVal_9331) .cse2 v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9330))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9329) .cse7 v_ArrVal_9331) (select (select (store .cse8 .cse7 v_ArrVal_9332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9333))) |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 06:49:09,074 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9426))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9330))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9425) .cse1 v_ArrVal_9329) .cse2 v_ArrVal_9331) (select (select (store .cse3 .cse2 v_ArrVal_9332) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9333))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9331 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9330 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9425 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9333 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9426))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9330))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9332))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9425) .cse6 v_ArrVal_9329) .cse7 v_ArrVal_9331) .cse8 v_ArrVal_9333) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 06:49:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [37732855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:49:09,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:49:09,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 06:49:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369171424] [2023-11-29 06:49:09,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:49:09,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:49:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:49:09,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:49:09,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=173, Unknown=24, NotChecked=494, Total=756 [2023-11-29 06:49:09,118 INFO L87 Difference]: Start difference. First operand 1270 states and 1425 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 06:51:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:51:00,852 INFO L93 Difference]: Finished difference Result 1811 states and 1965 transitions. [2023-11-29 06:51:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:51:00,853 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 109 [2023-11-29 06:51:00,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:51:00,856 INFO L225 Difference]: With dead ends: 1811 [2023-11-29 06:51:00,856 INFO L226 Difference]: Without dead ends: 1811 [2023-11-29 06:51:00,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=111, Invalid=374, Unknown=29, NotChecked=676, Total=1190 [2023-11-29 06:51:00,857 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 914 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 5790 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2778 SdHoareTripleChecker+Invalid, 5801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 103.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:51:00,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2778 Invalid, 5801 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 5790 Invalid, 0 Unknown, 0 Unchecked, 103.3s Time] [2023-11-29 06:51:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2023-11-29 06:51:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1269. [2023-11-29 06:51:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 779 states have (on average 1.7946084724005136) internal successors, (1398), 1257 states have internal predecessors, (1398), 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 06:51:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1424 transitions. [2023-11-29 06:51:00,872 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1424 transitions. Word has length 109 [2023-11-29 06:51:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:51:00,872 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1424 transitions. [2023-11-29 06:51:00,872 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 06:51:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1424 transitions. [2023-11-29 06:51:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 06:51:00,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:51:00,873 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:51:00,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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)] Ended with exit code 0 [2023-11-29 06:51:01,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 06:51:01,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:51:01,274 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:51:01,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:51:01,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1100931708, now seen corresponding path program 1 times [2023-11-29 06:51:01,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:51:01,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194706521] [2023-11-29 06:51:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:51:01,275 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 06:51:01,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:51:01,276 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 06:51:01,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/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 (36)] Waiting until timeout for monitored process [2023-11-29 06:51:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:51:02,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 06:51:02,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:51:02,842 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 06:51:04,721 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:51:04,721 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 06:51:04,999 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 06:51:05,909 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 06:51:13,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:51:13,837 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 06:51:14,782 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:51:14,782 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 06:51:15,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:51:15,559 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 06:51:16,425 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:51:16,425 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 06:51:17,257 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:51:17,258 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 06:51:17,402 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 06:51:17,792 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 06:51:17,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 06:51:18,291 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 06:51:18,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:51:19,187 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9885) |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 06:51:19,273 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:51:19,363 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9884))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:51:19,453 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9884))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:51:19,548 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9883))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:51:19,645 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9883))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:51:19,744 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9882))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9883)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:51:19,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9882))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9883)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:51:21,958 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9932 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9932))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9882)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9883)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9884)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9885)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:51:21,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:51:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194706521] [2023-11-29 06:51:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194706521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:51:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1407294829] [2023-11-29 06:51:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:51:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:51:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:51:21,982 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:51:21,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060cb2c-d448-4be6-89d1-2062e6b0959f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 06:51:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:51:28,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 06:51:28,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:51:28,279 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 06:51:31,771 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:51:31,772 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 06:51:32,465 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 06:51:34,020 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 20 treesize of output 12 [2023-11-29 06:51:43,765 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:51:43,765 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 06:51:45,275 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:51:45,275 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 06:51:46,391 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:51:46,392 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 06:51:47,408 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:51:47,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:51:48,513 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:51:48,514 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 06:51:48,651 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 06:51:49,234 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 06:51:49,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 06:51:49,556 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 06:51:49,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:51:54,335 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10392) |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 06:51:54,483 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10392) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 06:51:54,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10391))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10392)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 06:51:54,723 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10391))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10392)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 06:51:54,846 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10390 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10390))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10391)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10392)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)))) is different from false [2023-11-29 06:51:54,971 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10390 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10390))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10391)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10392)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 06:51:55,102 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10389 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10390 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (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$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10389))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10390)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10391)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10392)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 06:51:55,239 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10393 (_ BitVec 1)) (v_ArrVal_10389 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10391 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10392 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10390 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10393) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10389))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10390)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10391)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10392)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 06:51:58,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1407294829] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:51:58,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:51:58,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 06:51:58,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460413335] [2023-11-29 06:51:58,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:51:58,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 06:51:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:51:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 06:51:58,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=590, Unknown=18, NotChecked=1122, Total=1892 [2023-11-29 06:51:58,104 INFO L87 Difference]: Start difference. First operand 1269 states and 1424 transitions. Second operand has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)