./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/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_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/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_6f7d70f3-a180-4387-8327-25e197321140/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 ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:05:54,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:05:54,624 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:05:54,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:05:54,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:05:54,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:05:54,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:05:54,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:05:54,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:05:54,659 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:05:54,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:05:54,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:05:54,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:05:54,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:05:54,662 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:05:54,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:05:54,663 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:05:54,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:05:54,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:05:54,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:05:54,665 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:05:54,666 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:05:54,666 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:05:54,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:05:54,667 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:05:54,667 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:05:54,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:05:54,668 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:05:54,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:05:54,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:05:54,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:05:54,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:05:54,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:05:54,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:05:54,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:05:54,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:05:54,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:05:54,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:05:54,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:05:54,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:05:54,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:05:54,673 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_6f7d70f3-a180-4387-8327-25e197321140/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_6f7d70f3-a180-4387-8327-25e197321140/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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2023-11-29 06:05:54,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:05:54,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:05:54,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:05:54,926 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:05:54,926 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:05:54,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2023-11-29 06:05:57,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:05:57,937 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:05:57,937 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2023-11-29 06:05:57,960 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data/24f2b7b5a/d1f2bd7bfb3f4014977b70ab7f31ff78/FLAG113238f1e [2023-11-29 06:05:57,971 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data/24f2b7b5a/d1f2bd7bfb3f4014977b70ab7f31ff78 [2023-11-29 06:05:57,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:05:57,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:05:57,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:57,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:05:57,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:05:57,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:57" (1/1) ... [2023-11-29 06:05:57,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d7926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:57, skipping insertion in model container [2023-11-29 06:05:57,982 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:57" (1/1) ... [2023-11-29 06:05:58,039 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:05:58,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:05:58,677 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:05:58,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6250e772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:58, skipping insertion in model container [2023-11-29 06:05:58,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:58,687 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 06:05:58,689 INFO L158 Benchmark]: Toolchain (without parser) took 713.65ms. Allocated memory is still 178.3MB. Free memory was 138.8MB in the beginning and 149.7MB in the end (delta: -10.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 06:05:58,690 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:05:58,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.57ms. Allocated memory is still 178.3MB. Free memory was 138.8MB in the beginning and 149.7MB in the end (delta: -10.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 06:05:58,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.57ms. Allocated memory is still 178.3MB. Free memory was 138.8MB in the beginning and 149.7MB in the end (delta: -10.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/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_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/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_6f7d70f3-a180-4387-8327-25e197321140/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 ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:06:00,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:06:00,516 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 06:06:00,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:06:00,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:06:00,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:06:00,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:06:00,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:06:00,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:06:00,563 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:06:00,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:06:00,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:06:00,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:06:00,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:06:00,566 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:06:00,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:06:00,567 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:06:00,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:06:00,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:06:00,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:06:00,569 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:06:00,570 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:06:00,570 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:06:00,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:06:00,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:06:00,572 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:06:00,572 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:06:00,572 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:06:00,573 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:06:00,573 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:06:00,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:06:00,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:06:00,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:06:00,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:06:00,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:06:00,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:06:00,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:06:00,576 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:06:00,576 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:06:00,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:06:00,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:06:00,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:06:00,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:06:00,577 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:06:00,577 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_6f7d70f3-a180-4387-8327-25e197321140/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_6f7d70f3-a180-4387-8327-25e197321140/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 -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2023-11-29 06:06:00,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:06:00,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:06:00,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:06:00,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:06:00,872 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:06:00,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2023-11-29 06:06:03,615 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:06:03,918 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:06:03,918 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2023-11-29 06:06:03,937 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data/d38c54578/544d304661354fab8a766663aba456bc/FLAG02b0b6476 [2023-11-29 06:06:03,949 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/data/d38c54578/544d304661354fab8a766663aba456bc [2023-11-29 06:06:03,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:06:03,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:06:03,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:06:03,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:06:03,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:06:03,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:06:03" (1/1) ... [2023-11-29 06:06:03,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798d360d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:03, skipping insertion in model container [2023-11-29 06:06:03,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:06:03" (1/1) ... [2023-11-29 06:06:04,028 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:06:04,598 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:06:04,612 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 06:06:04,625 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:06:04,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:06:04,703 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:06:04,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:06:04,826 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:06:04,832 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:06:04,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04 WrapperNode [2023-11-29 06:06:04,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:06:04,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:06:04,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:06:04,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:06:04,839 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:06:04" (1/1) ... [2023-11-29 06:06:04,878 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:06:04" (1/1) ... [2023-11-29 06:06:04,937 INFO L138 Inliner]: procedures = 285, calls = 298, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1048 [2023-11-29 06:06:04,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:06:04,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:06:04,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:06:04,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:06:04,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:04,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:04,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,054 INFO L175 MemorySlicer]: Split 264 memory accesses to 5 slices as follows [2, 220, 3, 34, 5]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 56 writes are split as follows [0, 49, 2, 4, 1]. [2023-11-29 06:06:05,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,095 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:06:05,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:06:05,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:06:05,131 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:06:05,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (1/1) ... [2023-11-29 06:06:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:06:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:06:05,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/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:06:05,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/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:06:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 06:06:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 06:06:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 06:06:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 06:06:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 06:06:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 06:06:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 06:06:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 06:06:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 06:06:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 06:06:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 06:06:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 06:06:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:06:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 06:06:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:06:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:06:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:06:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 06:06:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:06:05,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:06:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:06:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:06:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 06:06:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2023-11-29 06:06:05,207 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2023-11-29 06:06:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 06:06:05,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 06:06:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:06:05,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2023-11-29 06:06:05,208 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2023-11-29 06:06:05,208 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2023-11-29 06:06:05,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:06:05,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:06:05,446 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:06:05,449 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:06:09,558 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:06:09,701 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:06:09,701 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 06:06:09,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:06:09 BoogieIcfgContainer [2023-11-29 06:06:09,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:06:09,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:06:09,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:06:09,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:06:09,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:06:03" (1/3) ... [2023-11-29 06:06:09,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed5b302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:06:09, skipping insertion in model container [2023-11-29 06:06:09,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:06:04" (2/3) ... [2023-11-29 06:06:09,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ed5b302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:06:09, skipping insertion in model container [2023-11-29 06:06:09,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:06:09" (3/3) ... [2023-11-29 06:06:09,710 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-1.i [2023-11-29 06:06:09,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:06:09,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 528 error locations. [2023-11-29 06:06:09,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:06:09,786 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;@1fb5174a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:06:09,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 528 error locations. [2023-11-29 06:06:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 06:06:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 06:06:09,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:09,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 06:06:09,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:09,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:09,829 INFO L85 PathProgramCache]: Analyzing trace with hash 55333, now seen corresponding path program 1 times [2023-11-29 06:06:09,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:09,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435787714] [2023-11-29 06:06:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:09,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:06:09,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:09,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:09,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:10,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:06:10,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:10,121 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:06:10,132 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:06:10,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:10,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435787714] [2023-11-29 06:06:10,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435787714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:10,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:10,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:06:10,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622125203] [2023-11-29 06:06:10,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:10,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:06:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:10,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:06:10,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:06:10,175 INFO L87 Difference]: Start difference. First operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:06:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:12,131 INFO L93 Difference]: Finished difference Result 1054 states and 1123 transitions. [2023-11-29 06:06:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:06:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 06:06:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:12,152 INFO L225 Difference]: With dead ends: 1054 [2023-11-29 06:06:12,153 INFO L226 Difference]: Without dead ends: 1053 [2023-11-29 06:06:12,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:06:12,156 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 650 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:12,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 862 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 06:06:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-11-29 06:06:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2023-11-29 06:06:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 459 states have (on average 2.3398692810457518) internal successors, (1074), 977 states have internal predecessors, (1074), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:06:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1104 transitions. [2023-11-29 06:06:12,241 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1104 transitions. Word has length 2 [2023-11-29 06:06:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:12,241 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1104 transitions. [2023-11-29 06:06:12,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:06:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1104 transitions. [2023-11-29 06:06:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 06:06:12,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:12,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 06:06:12,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:12,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:12,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:12,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash 55334, now seen corresponding path program 1 times [2023-11-29 06:06:12,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:12,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297430291] [2023-11-29 06:06:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:12,446 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:06:12,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:12,448 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:12,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:12,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:06:12,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:12,586 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:06:12,598 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:06:12,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:12,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297430291] [2023-11-29 06:06:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297430291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:06:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333274421] [2023-11-29 06:06:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:12,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:06:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:06:12,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:06:12,602 INFO L87 Difference]: Start difference. First operand 995 states and 1104 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:06:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:15,705 INFO L93 Difference]: Finished difference Result 1353 states and 1498 transitions. [2023-11-29 06:06:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:06:15,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 06:06:15,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:15,715 INFO L225 Difference]: With dead ends: 1353 [2023-11-29 06:06:15,715 INFO L226 Difference]: Without dead ends: 1353 [2023-11-29 06:06:15,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:06:15,716 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 382 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:15,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1265 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 06:06:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-11-29 06:06:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1165. [2023-11-29 06:06:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 628 states have (on average 2.3121019108280256) internal successors, (1452), 1145 states have internal predecessors, (1452), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:06:15,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1486 transitions. [2023-11-29 06:06:15,745 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1486 transitions. Word has length 2 [2023-11-29 06:06:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:15,745 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1486 transitions. [2023-11-29 06:06:15,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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:06:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1486 transitions. [2023-11-29 06:06:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 06:06:15,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:15,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 06:06:15,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-29 06:06:15,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:15,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:15,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash -435639276, now seen corresponding path program 1 times [2023-11-29 06:06:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:15,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494663190] [2023-11-29 06:06:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:15,948 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:06:15,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:15,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:15,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:16,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:06:16,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:16,086 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:06:16,093 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:06:16,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:06:16,161 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:06:16,182 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:06:16,183 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:06:16,205 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:06:16,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:16,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:16,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494663190] [2023-11-29 06:06:16,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494663190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:16,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:16,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:06:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053312896] [2023-11-29 06:06:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:16,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:16,208 INFO L87 Difference]: Start difference. First operand 1165 states and 1486 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:20,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:20,024 INFO L93 Difference]: Finished difference Result 1792 states and 2170 transitions. [2023-11-29 06:06:20,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:06:20,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 06:06:20,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:20,033 INFO L225 Difference]: With dead ends: 1792 [2023-11-29 06:06:20,033 INFO L226 Difference]: Without dead ends: 1792 [2023-11-29 06:06:20,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:06:20,035 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 1292 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:20,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1013 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 06:06:20,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-11-29 06:06:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1281. [2023-11-29 06:06:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 744 states have (on average 2.293010752688172) internal successors, (1706), 1261 states have internal predecessors, (1706), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:06:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1740 transitions. [2023-11-29 06:06:20,066 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1740 transitions. Word has length 6 [2023-11-29 06:06:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:20,067 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1740 transitions. [2023-11-29 06:06:20,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1740 transitions. [2023-11-29 06:06:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 06:06:20,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:20,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:20,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:20,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:20,269 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:20,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash -619915645, now seen corresponding path program 1 times [2023-11-29 06:06:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:20,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863955520] [2023-11-29 06:06:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:06:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:20,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:20,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:20,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:06:20,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:20,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:06:20,404 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:06:20,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:20,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:20,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863955520] [2023-11-29 06:06:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863955520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:20,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:20,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:06:20,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822678835] [2023-11-29 06:06:20,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:20,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:06:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:20,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:06:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:06:20,406 INFO L87 Difference]: Start difference. First operand 1281 states and 1740 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:22,511 INFO L93 Difference]: Finished difference Result 1760 states and 2444 transitions. [2023-11-29 06:06:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:06:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 06:06:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:22,519 INFO L225 Difference]: With dead ends: 1760 [2023-11-29 06:06:22,519 INFO L226 Difference]: Without dead ends: 1760 [2023-11-29 06:06:22,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:06:22,520 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 869 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:22,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1073 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 06:06:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2023-11-29 06:06:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1236. [2023-11-29 06:06:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 744 states have (on average 2.213709677419355) internal successors, (1647), 1216 states have internal predecessors, (1647), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:06:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1681 transitions. [2023-11-29 06:06:22,550 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1681 transitions. Word has length 7 [2023-11-29 06:06:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:22,551 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1681 transitions. [2023-11-29 06:06:22,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1681 transitions. [2023-11-29 06:06:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 06:06:22,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:22,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:22,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:22,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:22,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:22,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash -619915644, now seen corresponding path program 1 times [2023-11-29 06:06:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:22,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013712761] [2023-11-29 06:06:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:22,754 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:06:22,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:22,755 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:22,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:22,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:06:22,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:22,884 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:06:22,908 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:06:22,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:22,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013712761] [2023-11-29 06:06:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013712761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:06:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547814827] [2023-11-29 06:06:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:22,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:06:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:06:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:06:22,911 INFO L87 Difference]: Start difference. First operand 1236 states and 1681 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:25,967 INFO L93 Difference]: Finished difference Result 1793 states and 2433 transitions. [2023-11-29 06:06:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:06:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 06:06:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:25,975 INFO L225 Difference]: With dead ends: 1793 [2023-11-29 06:06:25,975 INFO L226 Difference]: Without dead ends: 1793 [2023-11-29 06:06:25,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:06:25,976 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 620 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:25,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1340 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 06:06:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2023-11-29 06:06:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1226. [2023-11-29 06:06:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 744 states have (on average 2.181451612903226) internal successors, (1623), 1206 states have internal predecessors, (1623), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:06:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1657 transitions. [2023-11-29 06:06:26,012 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1657 transitions. Word has length 7 [2023-11-29 06:06:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:26,012 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1657 transitions. [2023-11-29 06:06:26,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1657 transitions. [2023-11-29 06:06:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 06:06:26,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:26,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:26,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:26,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:26,216 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:26,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:26,216 INFO L85 PathProgramCache]: Analyzing trace with hash -3807760, now seen corresponding path program 1 times [2023-11-29 06:06:26,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:26,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146820692] [2023-11-29 06:06:26,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:26,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:06:26,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:26,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:26,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:26,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:06:26,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:26,420 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:06:26,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:26,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:26,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146820692] [2023-11-29 06:06:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146820692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:26,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:26,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:06:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628824703] [2023-11-29 06:06:26,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:26,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:26,423 INFO L87 Difference]: Start difference. First operand 1226 states and 1657 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:28,235 INFO L93 Difference]: Finished difference Result 1658 states and 2181 transitions. [2023-11-29 06:06:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:06:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:06:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:28,243 INFO L225 Difference]: With dead ends: 1658 [2023-11-29 06:06:28,243 INFO L226 Difference]: Without dead ends: 1658 [2023-11-29 06:06:28,243 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:06:28,244 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 494 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:28,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2481 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 06:06:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2023-11-29 06:06:28,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1436. [2023-11-29 06:06:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 954 states have (on average 2.190775681341719) internal successors, (2090), 1416 states have internal predecessors, (2090), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:06:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2124 transitions. [2023-11-29 06:06:28,280 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2124 transitions. Word has length 12 [2023-11-29 06:06:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:28,280 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 2124 transitions. [2023-11-29 06:06:28,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2124 transitions. [2023-11-29 06:06:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 06:06:28,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:28,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:28,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:28,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:28,482 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:28,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash -592731144, now seen corresponding path program 1 times [2023-11-29 06:06:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:28,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830327699] [2023-11-29 06:06:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:28,483 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:06:28,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:28,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:28,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:28,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:06:28,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:28,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:06:28,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:28,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:28,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830327699] [2023-11-29 06:06:28,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830327699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:28,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:28,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:06:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584870627] [2023-11-29 06:06:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:28,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:06:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:28,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:06:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:06:28,607 INFO L87 Difference]: Start difference. First operand 1436 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:06:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:29,428 INFO L93 Difference]: Finished difference Result 1352 states and 1964 transitions. [2023-11-29 06:06:29,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:06:29,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:06:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:29,435 INFO L225 Difference]: With dead ends: 1352 [2023-11-29 06:06:29,435 INFO L226 Difference]: Without dead ends: 1352 [2023-11-29 06:06:29,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:06:29,436 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 70 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:29,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1583 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:06:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-11-29 06:06:29,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2023-11-29 06:06:29,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 894 states have (on average 2.1588366890380315) internal successors, (1930), 1332 states have internal predecessors, (1930), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 06:06:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1964 transitions. [2023-11-29 06:06:29,472 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1964 transitions. Word has length 12 [2023-11-29 06:06:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:29,472 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1964 transitions. [2023-11-29 06:06:29,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:06:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1964 transitions. [2023-11-29 06:06:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 06:06:29,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:29,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:29,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:29,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:29,674 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:29,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:29,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1869888457, now seen corresponding path program 1 times [2023-11-29 06:06:29,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:29,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604067702] [2023-11-29 06:06:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:29,675 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:06:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:29,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:29,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:29,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:06:29,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:29,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:06:29,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:06:29,843 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:06:29,847 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 30 treesize of output 39 [2023-11-29 06:06:29,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:06:29,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 06:06:29,920 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:06:29,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:29,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:29,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604067702] [2023-11-29 06:06:29,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604067702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:29,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:29,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:06:29,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367855251] [2023-11-29 06:06:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:29,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:29,922 INFO L87 Difference]: Start difference. First operand 1352 states and 1964 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:31,738 INFO L93 Difference]: Finished difference Result 1868 states and 2266 transitions. [2023-11-29 06:06:31,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:06:31,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 06:06:31,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:31,745 INFO L225 Difference]: With dead ends: 1868 [2023-11-29 06:06:31,745 INFO L226 Difference]: Without dead ends: 1868 [2023-11-29 06:06:31,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:06:31,746 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 821 mSDsluCounter, 1670 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:31,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 2546 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 06:06:31,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2023-11-29 06:06:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1085. [2023-11-29 06:06:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 629 states have (on average 2.1446740858505566) internal successors, (1349), 1067 states have internal predecessors, (1349), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:06:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1379 transitions. [2023-11-29 06:06:31,764 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1379 transitions. Word has length 15 [2023-11-29 06:06:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:31,764 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1379 transitions. [2023-11-29 06:06:31,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1379 transitions. [2023-11-29 06:06:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 06:06:31,765 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:31,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:31,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-29 06:06:31,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:31,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:31,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1792162074, now seen corresponding path program 1 times [2023-11-29 06:06:31,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:31,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842670149] [2023-11-29 06:06:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:31,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:06:31,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:31,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:31,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:32,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:06:32,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:32,150 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:06:32,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:32,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842670149] [2023-11-29 06:06:32,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842670149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:32,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:32,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:06:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837219862] [2023-11-29 06:06:32,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:32,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:06:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:06:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:06:32,153 INFO L87 Difference]: Start difference. First operand 1085 states and 1379 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:32,914 INFO L93 Difference]: Finished difference Result 1031 states and 1299 transitions. [2023-11-29 06:06:32,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:06:32,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 06:06:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:32,920 INFO L225 Difference]: With dead ends: 1031 [2023-11-29 06:06:32,920 INFO L226 Difference]: Without dead ends: 1031 [2023-11-29 06:06:32,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:06:32,921 INFO L413 NwaCegarLoop]: 779 mSDtfsCounter, 70 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:32,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1509 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:06:32,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-11-29 06:06:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2023-11-29 06:06:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 599 states have (on average 2.1185308848080133) internal successors, (1269), 1013 states have internal predecessors, (1269), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:06:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1299 transitions. [2023-11-29 06:06:32,940 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1299 transitions. Word has length 15 [2023-11-29 06:06:32,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:32,941 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1299 transitions. [2023-11-29 06:06:32,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1299 transitions. [2023-11-29 06:06:32,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 06:06:32,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:32,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:32,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:33,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:33,142 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:33,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash -14134636, now seen corresponding path program 1 times [2023-11-29 06:06:33,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:33,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417288002] [2023-11-29 06:06:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:33,144 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:06:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:33,145 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:33,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:33,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:06:33,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:33,383 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:06:33,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:33,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417288002] [2023-11-29 06:06:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417288002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:06:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046091591] [2023-11-29 06:06:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:33,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:33,385 INFO L87 Difference]: Start difference. First operand 1031 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:34,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:34,325 INFO L93 Difference]: Finished difference Result 1017 states and 1257 transitions. [2023-11-29 06:06:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:06:34,326 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 06:06:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:34,332 INFO L225 Difference]: With dead ends: 1017 [2023-11-29 06:06:34,332 INFO L226 Difference]: Without dead ends: 1017 [2023-11-29 06:06:34,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:06:34,333 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 58 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:34,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2220 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:06:34,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2023-11-29 06:06:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2023-11-29 06:06:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 597 states have (on average 2.0519262981574538) internal successors, (1225), 997 states have internal predecessors, (1225), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:06:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1255 transitions. [2023-11-29 06:06:34,352 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1255 transitions. Word has length 17 [2023-11-29 06:06:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:34,352 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1255 transitions. [2023-11-29 06:06:34,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1255 transitions. [2023-11-29 06:06:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 06:06:34,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:34,353 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] [2023-11-29 06:06:34,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:34,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:34,554 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:34,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash 734266083, now seen corresponding path program 1 times [2023-11-29 06:06:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:34,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908906718] [2023-11-29 06:06:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:34,555 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:06:34,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:34,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:34,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:34,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:06:34,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:34,751 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:06:34,939 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:06:34,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:34,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908906718] [2023-11-29 06:06:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908906718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:34,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:34,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:06:34,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993750978] [2023-11-29 06:06:34,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:34,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:34,941 INFO L87 Difference]: Start difference. First operand 1015 states and 1255 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:06:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:38,408 INFO L93 Difference]: Finished difference Result 1482 states and 1848 transitions. [2023-11-29 06:06:38,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:06:38,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-11-29 06:06:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:38,415 INFO L225 Difference]: With dead ends: 1482 [2023-11-29 06:06:38,416 INFO L226 Difference]: Without dead ends: 1482 [2023-11-29 06:06:38,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:06:38,416 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 523 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:38,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1885 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 06:06:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2023-11-29 06:06:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1011. [2023-11-29 06:06:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 597 states have (on average 2.0385259631490786) internal successors, (1217), 993 states have internal predecessors, (1217), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:06:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1247 transitions. [2023-11-29 06:06:38,436 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1247 transitions. Word has length 31 [2023-11-29 06:06:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:38,436 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1247 transitions. [2023-11-29 06:06:38,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:06:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1247 transitions. [2023-11-29 06:06:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 06:06:38,437 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:38,437 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] [2023-11-29 06:06:38,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:38,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:38,638 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:38,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 734266082, now seen corresponding path program 1 times [2023-11-29 06:06:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:38,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806582265] [2023-11-29 06:06:38,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:38,639 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:06:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:38,640 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:38,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:38,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:06:38,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:38,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:06:38,872 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:06:38,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:38,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806582265] [2023-11-29 06:06:38,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806582265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:38,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:38,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:06:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518169804] [2023-11-29 06:06:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:38,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:38,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:38,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:38,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:38,874 INFO L87 Difference]: Start difference. First operand 1011 states and 1247 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:06:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:40,928 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2023-11-29 06:06:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:06:40,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2023-11-29 06:06:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:40,934 INFO L225 Difference]: With dead ends: 1391 [2023-11-29 06:06:40,935 INFO L226 Difference]: Without dead ends: 1391 [2023-11-29 06:06:40,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:06:40,935 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 754 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:40,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1032 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 06:06:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-11-29 06:06:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1007. [2023-11-29 06:06:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 597 states have (on average 2.0251256281407035) internal successors, (1209), 989 states have internal predecessors, (1209), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:06:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1239 transitions. [2023-11-29 06:06:40,954 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1239 transitions. Word has length 31 [2023-11-29 06:06:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:40,954 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1239 transitions. [2023-11-29 06:06:40,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:06:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1239 transitions. [2023-11-29 06:06:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 06:06:40,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:40,956 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] [2023-11-29 06:06:40,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:41,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:41,156 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:41,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2030840777, now seen corresponding path program 1 times [2023-11-29 06:06:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419854836] [2023-11-29 06:06:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:41,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:06:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:41,159 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:41,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:41,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:06:41,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:41,405 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:06:41,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:41,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419854836] [2023-11-29 06:06:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419854836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:41,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:41,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:06:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493959393] [2023-11-29 06:06:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:41,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:41,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:41,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:41,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:41,407 INFO L87 Difference]: Start difference. First operand 1007 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:42,266 INFO L93 Difference]: Finished difference Result 995 states and 1219 transitions. [2023-11-29 06:06:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:06:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-29 06:06:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:42,271 INFO L225 Difference]: With dead ends: 995 [2023-11-29 06:06:42,272 INFO L226 Difference]: Without dead ends: 995 [2023-11-29 06:06:42,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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:06:42,272 INFO L413 NwaCegarLoop]: 742 mSDtfsCounter, 23 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:42,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2206 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:06:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2023-11-29 06:06:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2023-11-29 06:06:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 585 states have (on average 2.0324786324786324) internal successors, (1189), 977 states have internal predecessors, (1189), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:06:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1219 transitions. [2023-11-29 06:06:42,284 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1219 transitions. Word has length 51 [2023-11-29 06:06:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:42,284 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1219 transitions. [2023-11-29 06:06:42,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1219 transitions. [2023-11-29 06:06:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 06:06:42,286 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:42,286 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] [2023-11-29 06:06:42,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:42,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:42,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:42,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890552, now seen corresponding path program 1 times [2023-11-29 06:06:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:42,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454919041] [2023-11-29 06:06:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:42,489 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:06:42,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:42,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:42,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:42,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 06:06:42,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:42,891 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 06:06:42,892 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 21 treesize of output 20 [2023-11-29 06:06:42,928 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:06:42,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 06:06:43,223 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:06:43,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:43,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:43,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454919041] [2023-11-29 06:06:43,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454919041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:43,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:43,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:06:43,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837771877] [2023-11-29 06:06:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:43,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:06:43,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:43,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:06:43,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:06:43,226 INFO L87 Difference]: Start difference. First operand 995 states and 1219 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:45,492 INFO L93 Difference]: Finished difference Result 1813 states and 2222 transitions. [2023-11-29 06:06:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:06:45,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-11-29 06:06:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:45,502 INFO L225 Difference]: With dead ends: 1813 [2023-11-29 06:06:45,502 INFO L226 Difference]: Without dead ends: 1813 [2023-11-29 06:06:45,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 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:06:45,502 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 713 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:45,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 918 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 06:06:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-11-29 06:06:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1343. [2023-11-29 06:06:45,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 918 states have (on average 2.02723311546841) internal successors, (1861), 1313 states have internal predecessors, (1861), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-29 06:06:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1915 transitions. [2023-11-29 06:06:45,522 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1915 transitions. Word has length 55 [2023-11-29 06:06:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:45,522 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1915 transitions. [2023-11-29 06:06:45,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1915 transitions. [2023-11-29 06:06:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 06:06:45,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:45,523 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] [2023-11-29 06:06:45,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:45,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:45,724 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:45,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890553, now seen corresponding path program 1 times [2023-11-29 06:06:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:45,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479453901] [2023-11-29 06:06:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:45,725 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:06:45,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:45,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:45,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:46,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 06:06:46,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:46,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:06:46,066 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:06:46,131 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 06:06:46,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 06:06:46,767 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:06:46,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:46,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479453901] [2023-11-29 06:06:46,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479453901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:46,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:46,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:06:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441535666] [2023-11-29 06:06:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:46,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:06:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:46,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:06:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:46,770 INFO L87 Difference]: Start difference. First operand 1343 states and 1915 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:49,715 INFO L93 Difference]: Finished difference Result 1348 states and 1921 transitions. [2023-11-29 06:06:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:06:49,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-11-29 06:06:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:49,721 INFO L225 Difference]: With dead ends: 1348 [2023-11-29 06:06:49,721 INFO L226 Difference]: Without dead ends: 1348 [2023-11-29 06:06:49,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:06:49,722 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:49,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 06:06:49,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2023-11-29 06:06:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1348. [2023-11-29 06:06:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 922 states have (on average 2.022776572668113) internal successors, (1865), 1317 states have internal predecessors, (1865), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 06:06:49,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1921 transitions. [2023-11-29 06:06:49,749 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1921 transitions. Word has length 55 [2023-11-29 06:06:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:49,749 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1921 transitions. [2023-11-29 06:06:49,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1921 transitions. [2023-11-29 06:06:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 06:06:49,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:49,750 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:06:49,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:49,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:49,951 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:49,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash 298511460, now seen corresponding path program 1 times [2023-11-29 06:06:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:49,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666479917] [2023-11-29 06:06:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:49,952 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:06:49,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:49,953 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:49,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:50,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:06:50,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:50,308 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:06:50,309 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:50,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666479917] [2023-11-29 06:06:50,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666479917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:50,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:50,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:06:50,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921636581] [2023-11-29 06:06:50,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:50,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:06:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:06:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:06:50,311 INFO L87 Difference]: Start difference. First operand 1348 states and 1921 transitions. Second operand has 6 states, 6 states have (on average 9.5) 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:06:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:52,014 INFO L93 Difference]: Finished difference Result 1352 states and 1929 transitions. [2023-11-29 06:06:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:06:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) 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:06:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:52,025 INFO L225 Difference]: With dead ends: 1352 [2023-11-29 06:06:52,025 INFO L226 Difference]: Without dead ends: 1352 [2023-11-29 06:06:52,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:06:52,026 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 19 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:52,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3610 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 06:06:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-11-29 06:06:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2023-11-29 06:06:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 923 states have (on average 2.021668472372698) internal successors, (1866), 1318 states have internal predecessors, (1866), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (29), 22 states have call predecessors, (29), 26 states have call successors, (29) [2023-11-29 06:06:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1925 transitions. [2023-11-29 06:06:52,050 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1925 transitions. Word has length 59 [2023-11-29 06:06:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:52,050 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1925 transitions. [2023-11-29 06:06:52,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) 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:06:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1925 transitions. [2023-11-29 06:06:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 06:06:52,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:52,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:52,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:52,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:52,257 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:52,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1320167083, now seen corresponding path program 1 times [2023-11-29 06:06:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:52,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830984897] [2023-11-29 06:06:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:52,258 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:06:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:52,259 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:52,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:52,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:06:52,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:52,554 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:06:52,555 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:52,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:52,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830984897] [2023-11-29 06:06:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830984897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:52,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:06:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232282758] [2023-11-29 06:06:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:52,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:06:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:06:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:06:52,557 INFO L87 Difference]: Start difference. First operand 1350 states and 1925 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:54,002 INFO L93 Difference]: Finished difference Result 1374 states and 1949 transitions. [2023-11-29 06:06:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:06:54,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-11-29 06:06:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:54,008 INFO L225 Difference]: With dead ends: 1374 [2023-11-29 06:06:54,009 INFO L226 Difference]: Without dead ends: 1374 [2023-11-29 06:06:54,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:06:54,009 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 16 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3763 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:54,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3763 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 06:06:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-11-29 06:06:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1370. [2023-11-29 06:06:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 937 states have (on average 2.0117395944503733) internal successors, (1885), 1334 states have internal predecessors, (1885), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 06:06:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1946 transitions. [2023-11-29 06:06:54,033 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1946 transitions. Word has length 62 [2023-11-29 06:06:54,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:54,033 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1946 transitions. [2023-11-29 06:06:54,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:06:54,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1946 transitions. [2023-11-29 06:06:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 06:06:54,034 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:54,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:54,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:54,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:54,234 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:54,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:54,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192545, now seen corresponding path program 1 times [2023-11-29 06:06:54,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:54,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780731990] [2023-11-29 06:06:54,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:54,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:06:54,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:54,237 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:54,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:54,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:06:54,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:54,677 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:06:54,773 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2023-11-29 06:06:54,787 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 06:06:54,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 06:06:54,797 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:06:54,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:54,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:54,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780731990] [2023-11-29 06:06:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780731990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:54,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:06:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987341773] [2023-11-29 06:06:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:54,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:06:54,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:06:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-29 06:06:54,799 INFO L87 Difference]: Start difference. First operand 1370 states and 1946 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:06:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:06:57,138 INFO L93 Difference]: Finished difference Result 1753 states and 2454 transitions. [2023-11-29 06:06:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:06:57,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 06:06:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:06:57,146 INFO L225 Difference]: With dead ends: 1753 [2023-11-29 06:06:57,146 INFO L226 Difference]: Without dead ends: 1753 [2023-11-29 06:06:57,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-29 06:06:57,147 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 723 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:06:57,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 977 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1113 Invalid, 0 Unknown, 1207 Unchecked, 2.3s Time] [2023-11-29 06:06:57,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2023-11-29 06:06:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1369. [2023-11-29 06:06:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 937 states have (on average 2.0096051227321237) internal successors, (1883), 1333 states have internal predecessors, (1883), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 06:06:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1944 transitions. [2023-11-29 06:06:57,180 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1944 transitions. Word has length 64 [2023-11-29 06:06:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:06:57,181 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 1944 transitions. [2023-11-29 06:06:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:06:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1944 transitions. [2023-11-29 06:06:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 06:06:57,181 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:06:57,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:06:57,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:57,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:57,382 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:06:57,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:06:57,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192544, now seen corresponding path program 1 times [2023-11-29 06:06:57,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:06:57,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182541283] [2023-11-29 06:06:57,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:06:57,383 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:06:57,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:06:57,384 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:57,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:06:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:06:57,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:06:57,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:06:57,803 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:06:57,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:06:58,232 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2023-11-29 06:06:58,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:06:58,246 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:06:58,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:06:58,270 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:06:58,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:06:58,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:06:58,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:06:58,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182541283] [2023-11-29 06:06:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182541283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:06:58,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:06:58,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:06:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216092763] [2023-11-29 06:06:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:06:58,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:06:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:06:58,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:06:58,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-11-29 06:06:58,282 INFO L87 Difference]: Start difference. First operand 1369 states and 1944 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:07:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:03,170 INFO L93 Difference]: Finished difference Result 2312 states and 3241 transitions. [2023-11-29 06:07:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:07:03,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 06:07:03,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:03,178 INFO L225 Difference]: With dead ends: 2312 [2023-11-29 06:07:03,178 INFO L226 Difference]: Without dead ends: 2312 [2023-11-29 06:07:03,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-11-29 06:07:03,179 INFO L413 NwaCegarLoop]: 788 mSDtfsCounter, 1304 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1617 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:03,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1499 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2060 Invalid, 0 Unknown, 1617 Unchecked, 4.8s Time] [2023-11-29 06:07:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2023-11-29 06:07:03,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1365. [2023-11-29 06:07:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 941 states have (on average 1.9883103081827842) internal successors, (1871), 1329 states have internal predecessors, (1871), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 06:07:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1932 transitions. [2023-11-29 06:07:03,202 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1932 transitions. Word has length 64 [2023-11-29 06:07:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:03,202 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1932 transitions. [2023-11-29 06:07:03,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:07:03,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1932 transitions. [2023-11-29 06:07:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 06:07:03,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:03,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:03,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 06:07:03,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:03,403 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:03,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1110857919, now seen corresponding path program 1 times [2023-11-29 06:07:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:03,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565037720] [2023-11-29 06:07:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:07:03,404 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:07:03,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:03,405 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:03,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 06:07:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:07:03,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 06:07:03,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:03,684 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:07:03,701 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:07:03,725 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:07:03,756 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:07:03,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:07:03,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565037720] [2023-11-29 06:07:03,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565037720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:07:03,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:07:03,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 06:07:03,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234043977] [2023-11-29 06:07:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:07:03,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:07:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:07:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:07:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:07:03,758 INFO L87 Difference]: Start difference. First operand 1365 states and 1932 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:07:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:07,906 INFO L93 Difference]: Finished difference Result 1376 states and 1944 transitions. [2023-11-29 06:07:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:07:07,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-29 06:07:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:07,911 INFO L225 Difference]: With dead ends: 1376 [2023-11-29 06:07:07,911 INFO L226 Difference]: Without dead ends: 1376 [2023-11-29 06:07:07,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:07:07,912 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 14 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3256 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:07,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3256 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 06:07:07,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2023-11-29 06:07:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1375. [2023-11-29 06:07:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.9841938883034773) internal successors, (1883), 1337 states have internal predecessors, (1883), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 06:07:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1944 transitions. [2023-11-29 06:07:07,936 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1944 transitions. Word has length 70 [2023-11-29 06:07:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:07,937 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1944 transitions. [2023-11-29 06:07:07,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:07:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1944 transitions. [2023-11-29 06:07:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 06:07:07,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:07,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:07,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 06:07:08,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:08,138 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:08,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash 76857197, now seen corresponding path program 1 times [2023-11-29 06:07:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417922967] [2023-11-29 06:07:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:07:08,139 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:07:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:08,140 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:08,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:07:08,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 06:07:08,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:08,442 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:07:08,482 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:07:08,489 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:07:08,530 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:07:08,609 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:07:08,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:07:08,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:08,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417922967] [2023-11-29 06:07:08,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417922967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:07:08,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:07:08,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 06:07:08,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342713289] [2023-11-29 06:07:08,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:07:08,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:07:08,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:07:08,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:07:08,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:07:08,611 INFO L87 Difference]: Start difference. First operand 1375 states and 1944 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:07:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:14,120 INFO L93 Difference]: Finished difference Result 1375 states and 1942 transitions. [2023-11-29 06:07:14,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:07:14,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2023-11-29 06:07:14,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:14,124 INFO L225 Difference]: With dead ends: 1375 [2023-11-29 06:07:14,124 INFO L226 Difference]: Without dead ends: 1375 [2023-11-29 06:07:14,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:07:14,125 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 12 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:14,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3828 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-11-29 06:07:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2023-11-29 06:07:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2023-11-29 06:07:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.982086406743941) internal successors, (1881), 1337 states have internal predecessors, (1881), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-11-29 06:07:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1942 transitions. [2023-11-29 06:07:14,148 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1942 transitions. Word has length 71 [2023-11-29 06:07:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:14,149 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1942 transitions. [2023-11-29 06:07:14,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 06:07:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1942 transitions. [2023-11-29 06:07:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 06:07:14,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:14,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:14,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:14,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:14,351 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:14,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -998618493, now seen corresponding path program 1 times [2023-11-29 06:07:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744350144] [2023-11-29 06:07:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:07:14,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:07:14,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:14,353 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:14,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 06:07:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:07:14,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:07:14,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:14,685 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:07:14,685 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:07:14,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:14,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744350144] [2023-11-29 06:07:14,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744350144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:07:14,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:07:14,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:07:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036345453] [2023-11-29 06:07:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:07:14,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:07:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:07:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:07:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:07:14,687 INFO L87 Difference]: Start difference. First operand 1375 states and 1942 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 06:07:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:15,627 INFO L93 Difference]: Finished difference Result 1383 states and 1952 transitions. [2023-11-29 06:07:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:07:15,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2023-11-29 06:07:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:15,631 INFO L225 Difference]: With dead ends: 1383 [2023-11-29 06:07:15,631 INFO L226 Difference]: Without dead ends: 1381 [2023-11-29 06:07:15,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:07:15,632 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 4 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:15,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2227 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:07:15,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2023-11-29 06:07:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2023-11-29 06:07:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 953 states have (on average 1.9800629590766001) internal successors, (1887), 1343 states have internal predecessors, (1887), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:07:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1950 transitions. [2023-11-29 06:07:15,647 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1950 transitions. Word has length 76 [2023-11-29 06:07:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:15,648 INFO L495 AbstractCegarLoop]: Abstraction has 1381 states and 1950 transitions. [2023-11-29 06:07:15,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 06:07:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1950 transitions. [2023-11-29 06:07:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 06:07:15,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:15,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:15,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 06:07:15,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:15,849 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:15,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2135152941, now seen corresponding path program 1 times [2023-11-29 06:07:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385995407] [2023-11-29 06:07:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:07:15,851 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:07:15,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:15,852 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:15,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:07:16,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:07:16,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:16,192 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:07:16,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:07:16,297 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:07:16,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:16,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385995407] [2023-11-29 06:07:16,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385995407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:07:16,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:07:16,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 06:07:16,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505129904] [2023-11-29 06:07:16,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:07:16,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:07:16,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:07:16,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:07:16,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:07:16,304 INFO L87 Difference]: Start difference. First operand 1381 states and 1950 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:17,697 INFO L93 Difference]: Finished difference Result 1395 states and 1968 transitions. [2023-11-29 06:07:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:07:17,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-11-29 06:07:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:17,701 INFO L225 Difference]: With dead ends: 1395 [2023-11-29 06:07:17,702 INFO L226 Difference]: Without dead ends: 1391 [2023-11-29 06:07:17,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-11-29 06:07:17,702 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 27 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:17,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2967 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 06:07:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-11-29 06:07:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2023-11-29 06:07:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 961 states have (on average 1.9739854318418315) internal successors, (1897), 1351 states have internal predecessors, (1897), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:07:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1960 transitions. [2023-11-29 06:07:17,718 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1960 transitions. Word has length 77 [2023-11-29 06:07:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:17,719 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1960 transitions. [2023-11-29 06:07:17,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1960 transitions. [2023-11-29 06:07:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-29 06:07:17,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:17,720 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:17,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 06:07:17,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:17,920 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:17,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -239229693, now seen corresponding path program 2 times [2023-11-29 06:07:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:17,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754795245] [2023-11-29 06:07:17,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:07:17,921 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:07:17,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:17,922 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:17,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 06:07:18,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:07:18,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:07:18,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 06:07:18,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:18,607 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:07:18,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:07:18,911 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:07:18,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:18,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754795245] [2023-11-29 06:07:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754795245] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:07:18,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:07:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 06:07:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097577075] [2023-11-29 06:07:18,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:07:18,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:07:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:07:18,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:07:18,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-29 06:07:18,913 INFO L87 Difference]: Start difference. First operand 1389 states and 1960 transitions. Second operand has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:21,882 INFO L93 Difference]: Finished difference Result 1413 states and 1998 transitions. [2023-11-29 06:07:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 06:07:21,884 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2023-11-29 06:07:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:21,886 INFO L225 Difference]: With dead ends: 1413 [2023-11-29 06:07:21,887 INFO L226 Difference]: Without dead ends: 1409 [2023-11-29 06:07:21,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2023-11-29 06:07:21,888 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 32 mSDsluCounter, 5184 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5929 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:21,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5929 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 06:07:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2023-11-29 06:07:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1407. [2023-11-29 06:07:21,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 979 states have (on average 1.9622063329928499) internal successors, (1921), 1369 states have internal predecessors, (1921), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:07:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1984 transitions. [2023-11-29 06:07:21,908 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1984 transitions. Word has length 80 [2023-11-29 06:07:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:21,909 INFO L495 AbstractCegarLoop]: Abstraction has 1407 states and 1984 transitions. [2023-11-29 06:07:21,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1984 transitions. [2023-11-29 06:07:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 06:07:21,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:21,910 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:21,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-11-29 06:07:22,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:22,111 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:22,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1517835459, now seen corresponding path program 3 times [2023-11-29 06:07:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979037364] [2023-11-29 06:07:22,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:07:22,112 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:07:22,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:22,113 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:22,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:22,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 06:07:22,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:07:22,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 06:07:22,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:23,213 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:07:23,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:07:24,060 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:07:24,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:24,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979037364] [2023-11-29 06:07:24,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979037364] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:07:24,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:07:24,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-11-29 06:07:24,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908074819] [2023-11-29 06:07:24,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:07:24,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 06:07:24,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:07:24,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 06:07:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:07:24,062 INFO L87 Difference]: Start difference. First operand 1407 states and 1984 transitions. Second operand has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:31,690 INFO L93 Difference]: Finished difference Result 1449 states and 2056 transitions. [2023-11-29 06:07:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 06:07:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 86 [2023-11-29 06:07:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:31,693 INFO L225 Difference]: With dead ends: 1449 [2023-11-29 06:07:31,693 INFO L226 Difference]: Without dead ends: 1443 [2023-11-29 06:07:31,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 06:07:31,694 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 69 mSDsluCounter, 8891 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 9636 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:31,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 9636 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-29 06:07:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2023-11-29 06:07:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1443. [2023-11-29 06:07:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1015 states have (on average 1.9379310344827587) internal successors, (1967), 1405 states have internal predecessors, (1967), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:07:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2030 transitions. [2023-11-29 06:07:31,708 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2030 transitions. Word has length 86 [2023-11-29 06:07:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:31,708 INFO L495 AbstractCegarLoop]: Abstraction has 1443 states and 2030 transitions. [2023-11-29 06:07:31,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2030 transitions. [2023-11-29 06:07:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 06:07:31,709 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:31,709 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:31,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:31,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:31,910 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:31,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1951482947, now seen corresponding path program 4 times [2023-11-29 06:07:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471264887] [2023-11-29 06:07:31,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:07:31,911 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:07:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:31,912 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:31,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 06:07:32,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:07:32,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:07:32,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 06:07:32,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:32,920 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:07:32,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:07:35,100 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:07:35,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:35,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471264887] [2023-11-29 06:07:35,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471264887] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:07:35,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:07:35,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-11-29 06:07:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948211863] [2023-11-29 06:07:35,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:07:35,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 06:07:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:07:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 06:07:35,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2023-11-29 06:07:35,103 INFO L87 Difference]: Start difference. First operand 1443 states and 2030 transitions. Second operand has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:07:51,531 INFO L93 Difference]: Finished difference Result 1517 states and 2168 transitions. [2023-11-29 06:07:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 06:07:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2023-11-29 06:07:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:07:51,535 INFO L225 Difference]: With dead ends: 1517 [2023-11-29 06:07:51,535 INFO L226 Difference]: Without dead ends: 1513 [2023-11-29 06:07:51,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2023-11-29 06:07:51,539 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 127 mSDsluCounter, 17783 mSDsCounter, 0 mSdLazyCounter, 3924 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 18528 SdHoareTripleChecker+Invalid, 3974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:07:51,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 18528 Invalid, 3974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 3924 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 06:07:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2023-11-29 06:07:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2023-11-29 06:07:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1083 states have (on average 1.9012003693444137) internal successors, (2059), 1473 states have internal predecessors, (2059), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:07:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2122 transitions. [2023-11-29 06:07:51,554 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2122 transitions. Word has length 98 [2023-11-29 06:07:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:07:51,554 INFO L495 AbstractCegarLoop]: Abstraction has 1511 states and 2122 transitions. [2023-11-29 06:07:51,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 06:07:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2122 transitions. [2023-11-29 06:07:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 06:07:51,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:07:51,555 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:07:51,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 06:07:51,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:51,756 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:07:51,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:07:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash -487952893, now seen corresponding path program 5 times [2023-11-29 06:07:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:07:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606677803] [2023-11-29 06:07:51,757 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:07:51,757 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:07:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:07:51,758 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:51,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:07:53,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:07:53,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:07:53,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 06:07:53,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:07:53,404 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:07:53,518 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:07:53,519 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:07:53,551 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:07:53,649 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:07:54,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:07:54,874 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:07:54,930 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:07:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:07:54,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:07:55,364 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2691 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2691) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 06:07:55,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:07:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606677803] [2023-11-29 06:07:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606677803] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:07:55,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [125415492] [2023-11-29 06:07:55,366 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:07:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:07:55,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:07:55,367 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:07:55,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 06:09:10,476 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:09:10,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:09:10,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 06:09:10,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:09:10,662 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:09:10,922 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:09:10,923 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:09:10,976 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:09:11,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:09:12,089 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:09:12,089 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:09:12,186 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:09:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:09:12,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:09:16,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [125415492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:09:16,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:09:16,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2023-11-29 06:09:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145785930] [2023-11-29 06:09:16,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:09:16,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 06:09:16,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:09:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 06:09:16,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=314, Unknown=3, NotChecked=36, Total=420 [2023-11-29 06:09:16,665 INFO L87 Difference]: Start difference. First operand 1511 states and 2122 transitions. Second operand has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:09:21,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:09:25,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:09:29,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:09:33,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:09:43,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:09:43,912 INFO L93 Difference]: Finished difference Result 1892 states and 2626 transitions. [2023-11-29 06:09:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:09:43,912 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 120 [2023-11-29 06:09:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:09:43,915 INFO L225 Difference]: With dead ends: 1892 [2023-11-29 06:09:43,915 INFO L226 Difference]: Without dead ends: 1892 [2023-11-29 06:09:43,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=102, Invalid=499, Unknown=3, NotChecked=46, Total=650 [2023-11-29 06:09:43,916 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 737 mSDsluCounter, 3613 mSDsCounter, 0 mSdLazyCounter, 5033 mSolverCounterSat, 24 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 5061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 5033 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:09:43,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 4005 Invalid, 5061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 5033 Invalid, 4 Unknown, 0 Unchecked, 26.9s Time] [2023-11-29 06:09:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2023-11-29 06:09:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1508. [2023-11-29 06:09:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1083 states have (on average 1.8956602031394276) internal successors, (2053), 1470 states have internal predecessors, (2053), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:09:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2116 transitions. [2023-11-29 06:09:43,934 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2116 transitions. Word has length 120 [2023-11-29 06:09:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:09:43,934 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 2116 transitions. [2023-11-29 06:09:43,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:09:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2116 transitions. [2023-11-29 06:09:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 06:09:43,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:09:43,935 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:09:43,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:09:44,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-29 06:09:44,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:09:44,336 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:09:44,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:09:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash -487952892, now seen corresponding path program 1 times [2023-11-29 06:09:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:09:44,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372251949] [2023-11-29 06:09:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:09:44,339 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:09:44,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:09:44,340 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:09:44,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:09:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:09:45,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 06:09:45,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:09:45,182 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:09:45,489 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:09:45,540 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:09:45,540 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:09:45,588 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:09:45,593 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:09:45,737 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:09:45,742 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:09:46,861 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:09:46,861 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:09:46,867 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:09:46,932 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:09:46,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:09:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:09:46,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:09:48,593 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3737 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:09:48,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:09:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372251949] [2023-11-29 06:09:48,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372251949] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:09:48,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1915558213] [2023-11-29 06:09:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:09:48,600 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:09:48,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:09:48,600 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:09:48,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 06:11:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:11:39,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 06:11:39,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:11:39,437 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:11:39,731 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:11:39,750 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:11:39,750 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:11:39,777 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:11:39,782 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:11:39,839 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:11:39,844 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:11:40,817 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:11:40,817 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:11:40,825 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:11:40,884 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:11:40,892 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:11:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:11:40,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:11:42,291 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4306) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_4307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4306) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4307) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:11:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1915558213] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:11:42,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:11:42,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2023-11-29 06:11:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311177330] [2023-11-29 06:11:42,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:11:42,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:11:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:11:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:11:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=203, Unknown=2, NotChecked=58, Total=306 [2023-11-29 06:11:42,298 INFO L87 Difference]: Start difference. First operand 1508 states and 2116 transitions. Second operand has 14 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:11:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:11:59,720 INFO L93 Difference]: Finished difference Result 2026 states and 2831 transitions. [2023-11-29 06:11:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:11:59,720 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 120 [2023-11-29 06:11:59,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:11:59,723 INFO L225 Difference]: With dead ends: 2026 [2023-11-29 06:11:59,723 INFO L226 Difference]: Without dead ends: 2026 [2023-11-29 06:11:59,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=423, Unknown=2, NotChecked=86, Total=600 [2023-11-29 06:11:59,724 INFO L413 NwaCegarLoop]: 902 mSDtfsCounter, 507 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 6942 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 5075 SdHoareTripleChecker+Invalid, 6962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:11:59,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 5075 Invalid, 6962 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6942 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2023-11-29 06:11:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2023-11-29 06:11:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1507. [2023-11-29 06:11:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1083 states have (on average 1.8938134810710987) internal successors, (2051), 1469 states have internal predecessors, (2051), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:11:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2114 transitions. [2023-11-29 06:11:59,742 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2114 transitions. Word has length 120 [2023-11-29 06:11:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:11:59,743 INFO L495 AbstractCegarLoop]: Abstraction has 1507 states and 2114 transitions. [2023-11-29 06:11:59,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:11:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2114 transitions. [2023-11-29 06:11:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 06:11:59,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:11:59,744 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:11:59,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 06:11:59,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-11-29 06:12:00,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12:00,144 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:12:00,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash -769932828, now seen corresponding path program 1 times [2023-11-29 06:12:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:12:00,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959331739] [2023-11-29 06:12:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:00,146 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:12:00,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:12:00,147 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12:00,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:01,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 06:12:01,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:01,126 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:12:01,297 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:12:01,297 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:12:01,342 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:12:01,457 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:12:02,727 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:12:02,728 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:12:02,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:12:02,856 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:12:02,870 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:12:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:12:02,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:03,001 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4746) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:12:03,013 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4746 (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_4746) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:12:03,438 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4746 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (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| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4746)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:12:03,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:12:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959331739] [2023-11-29 06:12:03,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959331739] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:03,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1911609810] [2023-11-29 06:12:03,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:03,442 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:12:03,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:12:03,443 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:12:03,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 06:12:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:08,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 06:12:08,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:08,877 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:12:09,261 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:12:09,262 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:12:09,337 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:12:09,539 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:12:10,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:12:10,690 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:12:10,868 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:12:10,869 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:12:10,880 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:12:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:12:10,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:14,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5231 (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_5231) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:12:15,444 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5277 (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~mem73#1.base| v_ArrVal_5277))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5231)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:12:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1911609810] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:15,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:12:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-11-29 06:12:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952589603] [2023-11-29 06:12:15,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:12:15,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 06:12:15,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:12:15,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 06:12:15,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=387, Unknown=7, NotChecked=220, Total=702 [2023-11-29 06:12:15,449 INFO L87 Difference]: Start difference. First operand 1507 states and 2114 transitions. Second operand has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:12:20,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:12:24,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:12:28,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:12:32,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:12:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:12:43,520 INFO L93 Difference]: Finished difference Result 1890 states and 2622 transitions. [2023-11-29 06:12:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:12:43,520 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 122 [2023-11-29 06:12:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:12:43,523 INFO L225 Difference]: With dead ends: 1890 [2023-11-29 06:12:43,523 INFO L226 Difference]: Without dead ends: 1890 [2023-11-29 06:12:43,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=123, Invalid=592, Unknown=7, NotChecked=270, Total=992 [2023-11-29 06:12:43,524 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 733 mSDsluCounter, 3629 mSDsCounter, 0 mSdLazyCounter, 5078 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 5104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5078 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:12:43,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 4020 Invalid, 5104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5078 Invalid, 4 Unknown, 0 Unchecked, 27.8s Time] [2023-11-29 06:12:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2023-11-29 06:12:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1506. [2023-11-29 06:12:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1083 states have (on average 1.89196675900277) internal successors, (2049), 1468 states have internal predecessors, (2049), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:12:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2112 transitions. [2023-11-29 06:12:43,542 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2112 transitions. Word has length 122 [2023-11-29 06:12:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:12:43,542 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 2112 transitions. [2023-11-29 06:12:43,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:12:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2112 transitions. [2023-11-29 06:12:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 06:12:43,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:12:43,543 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:12:43,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-11-29 06:12:43,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12:43,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12:43,944 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:12:43,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:12:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash -769932827, now seen corresponding path program 1 times [2023-11-29 06:12:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:12:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571755811] [2023-11-29 06:12:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:43,945 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:12:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:12:43,946 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12:43,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:12:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:44,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 06:12:44,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:44,876 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:12:45,225 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:12:45,265 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:12:45,265 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:12:45,322 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:12:45,334 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:12:45,461 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:12:45,465 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:12:46,510 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:12:46,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:12:46,517 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:12:46,670 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:12:46,671 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:12:46,678 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:12:46,694 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:12:46,700 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:12:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:12:46,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:46,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5762) |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~mem74#1.base| v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:12:46,956 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_5762 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:12:48,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5854))) (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~mem73#1.base| v_ArrVal_5853) .cse0 v_ArrVal_5762) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5854 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5762 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5853) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5854) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5762) |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:12:48,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:12:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571755811] [2023-11-29 06:12:48,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571755811] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1713787068] [2023-11-29 06:12:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:12:48,561 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:12:48,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:12:48,562 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:12:48,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 06:12:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:12:52,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 06:12:52,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:12:52,877 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:12:53,161 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:12:53,182 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:12:53,182 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:12:53,204 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:12:53,212 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:12:53,288 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:12:53,293 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:12:54,223 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:12:54,223 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:12:54,230 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:12:54,317 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:12:54,318 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:12:54,323 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:12:54,342 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:12:54,348 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:12:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:12:54,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:12:54,409 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6339 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6338) |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~mem74#1.base| v_ArrVal_6339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6338 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6338) |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:12:54,452 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_6338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6339 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6338) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6338 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6338) |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:12:55,965 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6339 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6431))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6430) .cse0 v_ArrVal_6338) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6339) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6431 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6430) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6338) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 06:12:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1713787068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:12:55,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:12:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2023-11-29 06:12:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476882718] [2023-11-29 06:12:55,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:12:55,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 06:12:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:12:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 06:12:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=235, Unknown=6, NotChecked=210, Total=506 [2023-11-29 06:12:55,977 INFO L87 Difference]: Start difference. First operand 1506 states and 2112 transitions. Second operand has 15 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:13:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:13:12,663 INFO L93 Difference]: Finished difference Result 2024 states and 2827 transitions. [2023-11-29 06:13:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:13:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 122 [2023-11-29 06:13:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:13:12,666 INFO L225 Difference]: With dead ends: 2024 [2023-11-29 06:13:12,666 INFO L226 Difference]: Without dead ends: 2024 [2023-11-29 06:13:12,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=108, Invalid=510, Unknown=6, NotChecked=306, Total=930 [2023-11-29 06:13:12,667 INFO L413 NwaCegarLoop]: 901 mSDtfsCounter, 502 mSDsluCounter, 4317 mSDsCounter, 0 mSdLazyCounter, 6745 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 5218 SdHoareTripleChecker+Invalid, 6765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:13:12,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 5218 Invalid, 6765 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6745 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2023-11-29 06:13:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2023-11-29 06:13:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1505. [2023-11-29 06:13:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1083 states have (on average 1.8901200369344413) internal successors, (2047), 1467 states have internal predecessors, (2047), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:13:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2110 transitions. [2023-11-29 06:13:12,685 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2110 transitions. Word has length 122 [2023-11-29 06:13:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:13:12,685 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 2110 transitions. [2023-11-29 06:13:12,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:13:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2110 transitions. [2023-11-29 06:13:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 06:13:12,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:13:12,686 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:12,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 06:13:12,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 06:13:13,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:13:13,087 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:13:13,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715296, now seen corresponding path program 1 times [2023-11-29 06:13:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:13:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147950968] [2023-11-29 06:13:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:13,088 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:13:13,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:13:13,089 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:13:13,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:13:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:14,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 06:13:14,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:14,140 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:13:14,305 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:13:14,306 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:13:14,338 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:13:14,447 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:13:15,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:13:15,754 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:13:15,894 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:13:15,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:13:15,997 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:13:15,997 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:13:16,010 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:13:16,062 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:13:16,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:13:16,301 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6886 (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_6886) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:13:16,315 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6886 (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~mem74#1.base| v_ArrVal_6885))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6886)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:13:16,329 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6886 (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_6885))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6886)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:13:16,789 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6932 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6886 (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~mem73#1.base| v_ArrVal_6932))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6885)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6886)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:13:16,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:13:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147950968] [2023-11-29 06:13:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147950968] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:13:16,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1667701029] [2023-11-29 06:13:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:16,793 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:13:16,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:13:16,794 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:13:16,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 06:13:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:21,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 06:13:21,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:21,629 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:13:21,971 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:13:21,971 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:13:22,046 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:13:22,243 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:13:23,385 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:13:23,385 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:13:23,608 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:13:23,609 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:13:23,754 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:13:23,754 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:13:23,768 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:13:23,779 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:13:23,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:13:23,797 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7387 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7387) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 06:13:23,810 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7387 (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_7387) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 06:13:23,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7387 (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| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:13:23,839 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7387 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7386))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:13:24,246 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7386 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7387 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7433 (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~mem73#1.base| v_ArrVal_7433))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7386)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7387)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:13:24,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1667701029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:13:24,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:13:24,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-11-29 06:13:24,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085850657] [2023-11-29 06:13:24,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:13:24,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 06:13:24,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:13:24,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 06:13:24,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=469, Unknown=9, NotChecked=468, Total=1056 [2023-11-29 06:13:24,252 INFO L87 Difference]: Start difference. First operand 1505 states and 2110 transitions. Second operand has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:13:29,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:13:33,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:13:37,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:13:41,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:13:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:13:53,134 INFO L93 Difference]: Finished difference Result 1888 states and 2618 transitions. [2023-11-29 06:13:53,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:13:53,134 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-11-29 06:13:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:13:53,136 INFO L225 Difference]: With dead ends: 1888 [2023-11-29 06:13:53,136 INFO L226 Difference]: Without dead ends: 1888 [2023-11-29 06:13:53,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=694, Unknown=9, NotChecked=558, Total=1406 [2023-11-29 06:13:53,137 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 725 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 5498 mSolverCounterSat, 23 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 4349 SdHoareTripleChecker+Invalid, 5525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5498 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:13:53,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 4349 Invalid, 5525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5498 Invalid, 4 Unknown, 0 Unchecked, 28.6s Time] [2023-11-29 06:13:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2023-11-29 06:13:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1504. [2023-11-29 06:13:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1083 states have (on average 1.8882733148661126) internal successors, (2045), 1466 states have internal predecessors, (2045), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:13:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2108 transitions. [2023-11-29 06:13:53,152 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2108 transitions. Word has length 124 [2023-11-29 06:13:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:13:53,152 INFO L495 AbstractCegarLoop]: Abstraction has 1504 states and 2108 transitions. [2023-11-29 06:13:53,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:13:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2108 transitions. [2023-11-29 06:13:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 06:13:53,153 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:13:53,153 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:13:53,163 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 06:13:53,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 06:13:53,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:13:53,554 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:13:53,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:13:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715295, now seen corresponding path program 1 times [2023-11-29 06:13:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:13:53,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068564327] [2023-11-29 06:13:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:53,559 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:13:53,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:13:53,560 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:13:53,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 06:13:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:13:54,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 06:13:54,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:13:54,613 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:13:54,913 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:13:54,949 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:13:54,949 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:13:54,997 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:13:55,004 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:13:55,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 18 treesize of output 10 [2023-11-29 06:13:55,158 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:13:56,177 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:13:56,178 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:13:56,186 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:13:56,349 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:13:56,349 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:13:56,357 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:13:56,466 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:13:56,467 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:13:56,476 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:13:56,489 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:13:56,497 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:13:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:13:56,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:13:56,732 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7935) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7934 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7935) |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~mem75#1.base| v_ArrVal_7934) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:13:56,768 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_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7934 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7935) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7934) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7935) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 06:13:56,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7932 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7932))) (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~mem74#1.base| v_ArrVal_7933) .cse0 v_ArrVal_7935) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7934) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7932 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7933) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7935) |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:13:56,861 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_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7932 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7933) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7935) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7932 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7932))) (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_7933) .cse3 v_ArrVal_7935) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7934) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 06:13:58,421 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7932 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8027))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8026) .cse1 v_ArrVal_7933) (select (select (store .cse2 .cse1 v_ArrVal_7932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7935))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7934 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7933 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7932 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8027 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8026 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8027))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7932))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8026) .cse4 v_ArrVal_7933) .cse5 v_ArrVal_7935) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7934) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 06:13:58,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:13:58,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068564327] [2023-11-29 06:13:58,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068564327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:13:58,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [300258922] [2023-11-29 06:13:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:13:58,439 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:13:58,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:13:58,440 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:13:58,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 06:15:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:15:52,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 06:15:52,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:15:52,826 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:15:53,108 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:15:53,131 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:15:53,131 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:15:53,151 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:15:53,163 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:15:53,237 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:15:53,242 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:15:54,202 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:15:54,202 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:15:54,212 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:15:54,304 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:15:54,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 50 treesize of output 45 [2023-11-29 06:15:54,310 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:15:54,370 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:15:54,371 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:15:54,380 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:15:54,397 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:15:54,405 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:15:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:15:54,410 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:15:54,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 06:15:54,503 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_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 06:15:54,560 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8526))) (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~mem74#1.base| v_ArrVal_8527) .cse0 v_ArrVal_8528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8527) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8528) |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:15:57,405 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8529 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8621))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8526))) (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~mem73#1.base| v_ArrVal_8620) .cse0 v_ArrVal_8527) .cse1 v_ArrVal_8528) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8529) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8528 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8527 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8526 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8621 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8621))) (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~mem73#1.base| v_ArrVal_8620) .cse6 v_ArrVal_8527) (select (select (store .cse7 .cse6 v_ArrVal_8526) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8528))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 06:15:57,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [300258922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:15:57,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:15:57,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2023-11-29 06:15:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44554446] [2023-11-29 06:15:57,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:15:57,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 06:15:57,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:15:57,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 06:15:57,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=287, Unknown=20, NotChecked=378, Total=756 [2023-11-29 06:15:57,418 INFO L87 Difference]: Start difference. First operand 1504 states and 2108 transitions. Second operand has 16 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:16:17,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:16:17,332 INFO L93 Difference]: Finished difference Result 2022 states and 2823 transitions. [2023-11-29 06:16:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:16:17,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 124 [2023-11-29 06:16:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:16:17,335 INFO L225 Difference]: With dead ends: 2022 [2023-11-29 06:16:17,336 INFO L226 Difference]: Without dead ends: 2022 [2023-11-29 06:16:17,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=136, Invalid=634, Unknown=22, NotChecked=540, Total=1332 [2023-11-29 06:16:17,337 INFO L413 NwaCegarLoop]: 901 mSDtfsCounter, 497 mSDsluCounter, 4338 mSDsCounter, 0 mSdLazyCounter, 6715 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 5239 SdHoareTripleChecker+Invalid, 6734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 6715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:16:17,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 5239 Invalid, 6734 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 6715 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2023-11-29 06:16:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2023-11-29 06:16:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1503. [2023-11-29 06:16:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1083 states have (on average 1.886426592797784) internal successors, (2043), 1465 states have internal predecessors, (2043), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:16:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2106 transitions. [2023-11-29 06:16:17,361 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2106 transitions. Word has length 124 [2023-11-29 06:16:17,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:16:17,361 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 2106 transitions. [2023-11-29 06:16:17,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 06:16:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2106 transitions. [2023-11-29 06:16:17,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 06:16:17,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:16:17,363 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:16:17,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 06:16:17,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-11-29 06:16:17,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:16:17,763 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:16:17,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:16:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384054, now seen corresponding path program 1 times [2023-11-29 06:16:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:16:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820352731] [2023-11-29 06:16:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:16:17,765 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:16:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:16:17,771 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:16:17,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-11-29 06:16:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:16:19,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 06:16:19,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:16:19,134 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:16:19,352 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:16:19,352 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:16:19,401 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:16:19,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 06:16:21,314 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:16:21,315 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:16:21,494 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:16:21,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:16:21,623 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:16:21,624 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:16:21,779 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:16:21,779 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:16:21,797 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:16:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:16:21,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:16:22,002 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9092 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_9092) |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:16:22,018 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9092 (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_9092) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 06:16:22,035 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9091 (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~mem75#1.base| v_ArrVal_9091))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9092)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:16:22,054 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9091 (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_9091))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9092)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:16:22,077 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9090 (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~mem74#1.base| v_ArrVal_9090))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9091)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9092)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:16:22,099 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9090 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9090))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9091)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9092)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:16:22,637 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9092 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9091 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9138 (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~mem73#1.base| v_ArrVal_9138))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9090)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9091)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9092)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:16:22,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:16:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820352731] [2023-11-29 06:16:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820352731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:16:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1057352788] [2023-11-29 06:16:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:16:22,643 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:16:22,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:16:22,644 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:16:22,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 06:16:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:16:30,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 06:16:30,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:16:30,418 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:16:30,892 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:16:30,893 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:16:30,990 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:16:31,246 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:16:32,657 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:16:32,657 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:16:32,929 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:16:32,929 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:16:33,097 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:16:33,097 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:16:33,271 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:16:33,271 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:16:33,287 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:16:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:16:33,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:16:33,320 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_9609) |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:16:33,335 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9609 (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_9609) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 06:16:33,352 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9608 (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~mem75#1.base| v_ArrVal_9608))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9609)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:16:33,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9608 (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_9608))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9609)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:16:33,390 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9607 (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~mem74#1.base| v_ArrVal_9607))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9608)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9609)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:16:33,412 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9607 (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_9607))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9608)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9609)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:16:33,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9608 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9607 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9655))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9607)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9608)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9609)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:16:33,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1057352788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:16:33,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:16:33,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2023-11-29 06:16:33,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505256559] [2023-11-29 06:16:33,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:16:33,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 06:16:33,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:16:33,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 06:16:33,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=514, Unknown=14, NotChecked=826, Total=1482 [2023-11-29 06:16:33,954 INFO L87 Difference]: Start difference. First operand 1503 states and 2106 transitions. Second operand has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:16:39,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:16:43,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:16:47,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:16:51,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 06:17:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:17:06,661 INFO L93 Difference]: Finished difference Result 1886 states and 2614 transitions. [2023-11-29 06:17:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 06:17:06,662 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 126 [2023-11-29 06:17:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:17:06,664 INFO L225 Difference]: With dead ends: 1886 [2023-11-29 06:17:06,664 INFO L226 Difference]: Without dead ends: 1886 [2023-11-29 06:17:06,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=163, Invalid=749, Unknown=14, NotChecked=966, Total=1892 [2023-11-29 06:17:06,665 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 1351 mSDsluCounter, 4116 mSDsCounter, 0 mSdLazyCounter, 5816 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 4505 SdHoareTripleChecker+Invalid, 5847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 5816 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:17:06,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 4505 Invalid, 5847 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 5816 Invalid, 4 Unknown, 0 Unchecked, 32.3s Time] [2023-11-29 06:17:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2023-11-29 06:17:06,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1502. [2023-11-29 06:17:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1083 states have (on average 1.8845798707294552) internal successors, (2041), 1464 states have internal predecessors, (2041), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-29 06:17:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2104 transitions. [2023-11-29 06:17:06,681 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2104 transitions. Word has length 126 [2023-11-29 06:17:06,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:17:06,682 INFO L495 AbstractCegarLoop]: Abstraction has 1502 states and 2104 transitions. [2023-11-29 06:17:06,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 06:17:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2104 transitions. [2023-11-29 06:17:06,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 06:17:06,683 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:17:06,683 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:17:06,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-11-29 06:17:06,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2023-11-29 06:17:07,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:17:07,084 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-11-29 06:17:07,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:17:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384055, now seen corresponding path program 1 times [2023-11-29 06:17:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:17:07,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378603725] [2023-11-29 06:17:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:17:07,086 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:17:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:17:07,087 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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:17:07,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-11-29 06:17:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:17:08,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-29 06:17:08,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:17:08,594 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:17:08,817 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:17:08,864 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:17:08,864 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:17:08,907 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:17:08,913 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:17:09,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 06:17:09,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 06:17:10,413 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:17:10,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 06:17:10,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 06:17:10,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:17:10,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 06:17:10,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 06:17:10,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:17:10,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 06:17:10,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 06:17:10,908 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:17:10,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 06:17:10,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 06:17:10,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 06:17:10,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 06:17:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:17:11,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:17:11,256 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10174) |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~mem76#1.base| v_ArrVal_10173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10174) |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:17:11,297 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_10174 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10174) |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_10173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:17:11,420 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10171) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10172))) (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~mem75#1.base| v_ArrVal_10171) .cse2 v_ArrVal_10174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:17:11,534 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_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10171) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10172))) (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_10171) .cse3 v_ArrVal_10174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 06:17:13,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10170 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10170))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10169) .cse1 v_ArrVal_10171) (select (select (store .cse2 .cse1 v_ArrVal_10172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10174))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10170 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10170))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10172))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10169) .cse4 v_ArrVal_10171) .cse5 v_ArrVal_10174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 06:17:26,467 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10170 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10265))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10170))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10172))) (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~mem73#1.base| v_ArrVal_10266) .cse0 v_ArrVal_10169) .cse1 v_ArrVal_10171) .cse2 v_ArrVal_10174) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10169 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10170 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10265))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10170))) (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~mem73#1.base| v_ArrVal_10266) .cse8 v_ArrVal_10169) .cse9 v_ArrVal_10171) (select (select (store .cse10 .cse9 v_ArrVal_10172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10174))))) |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:17:26,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:17:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378603725] [2023-11-29 06:17:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378603725] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:17:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [212416976] [2023-11-29 06:17:26,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:17:26,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:17:26,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:17:26,507 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:17:26,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f7d70f3-a180-4387-8327-25e197321140/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-11-29 06:19:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:19:37,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 128 conjunts are in the unsatisfiable core [2023-11-29 06:19:37,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:19:37,765 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:19:39,975 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:19:40,094 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:19:40,095 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:19:40,552 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:19:40,590 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:19:41,660 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:19:41,680 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:19:46,357 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:19:46,357 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:19:46,397 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:19:47,456 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:19:47,457 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:19:47,497 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:19:48,173 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:19:48,173 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:19:48,211 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:19:48,874 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:19:48,875 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:19:48,914 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:19:49,016 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:19:49,037 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:19:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 06:19:49,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:19:49,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10784) |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~mem76#1.base| v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:19:49,323 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_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 06:19:49,440 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10782))) (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~mem75#1.base| v_ArrVal_10783) .cse0 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10783) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 06:19:49,548 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_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10782))) (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_10783) .cse1 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_10783) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 06:19:51,225 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10781))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10780) .cse1 v_ArrVal_10783) (select (select (store .cse2 .cse1 v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10784))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10781))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10782))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10780) .cse4 v_ArrVal_10783) .cse5 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 06:19:52,473 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10781))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10780) .cse2 v_ArrVal_10783) (select (select (store .cse3 .cse2 v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10784))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_10781))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10782))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_10780) .cse5 v_ArrVal_10783) .cse6 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 06:19:57,730 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10876))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10781))) (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~mem73#1.base| v_ArrVal_10877) .cse1 v_ArrVal_10780) .cse2 v_ArrVal_10783) (select (select (store .cse3 .cse2 v_ArrVal_10782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10784))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10782 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10876))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10781))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10782))) (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~mem73#1.base| v_ArrVal_10877) .cse6 v_ArrVal_10780) .cse7 v_ArrVal_10783) .cse8 v_ArrVal_10784) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10785) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 06:19:57,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [212416976] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:19:57,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:19:57,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2023-11-29 06:19:57,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168667027] [2023-11-29 06:19:57,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:19:57,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 06:19:57,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:19:57,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 06:19:57,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=611, Unknown=20, NotChecked=806, Total=1560 [2023-11-29 06:19:57,769 INFO L87 Difference]: Start difference. First operand 1502 states and 2104 transitions. Second operand has 24 states, 20 states have (on average 7.0) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)