./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:35:30,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:35:30,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:35:30,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:35:30,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:35:30,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:35:30,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:35:30,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:35:30,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:35:30,842 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:35:30,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:35:30,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:35:30,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:35:30,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:35:30,845 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:35:30,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:35:30,846 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:35:30,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:35:30,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:35:30,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:35:30,848 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:35:30,849 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:35:30,850 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:35:30,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:35:30,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:35:30,851 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:35:30,851 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:35:30,851 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:35:30,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:35:30,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:35:30,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:35:30,852 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:35:30,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:30,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:35:30,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:35:30,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:35:30,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:35:30,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:35:30,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:35:30,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:35:30,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:35:30,856 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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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 -> 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 [2023-11-29 00:35:31,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:35:31,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:35:31,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:35:31,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:35:31,089 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:35:31,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2023-11-29 00:35:33,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:35:34,138 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:35:34,138 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2023-11-29 00:35:34,156 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data/502e59a55/05150e567a7f49b69f2876c75fd207fb/FLAG6ae66ada9 [2023-11-29 00:35:34,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data/502e59a55/05150e567a7f49b69f2876c75fd207fb [2023-11-29 00:35:34,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:35:34,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:35:34,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:34,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:35:34,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:35:34,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eac2297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34, skipping insertion in model container [2023-11-29 00:35:34,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:34" (1/1) ... [2023-11-29 00:35:34,247 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:35:34,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:34,663 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 00:35:34,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40f71870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:34, skipping insertion in model container [2023-11-29 00:35:34,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:34,665 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 00:35:34,666 INFO L158 Benchmark]: Toolchain (without parser) took 491.60ms. Allocated memory is still 165.7MB. Free memory was 123.9MB in the beginning and 104.2MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 00:35:34,667 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:35:34,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.36ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 104.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 00:35:34,670 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.36ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 104.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: 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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:35:36,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:35:36,480 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:35:36,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:35:36,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:35:36,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:35:36,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:35:36,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:35:36,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:35:36,515 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:35:36,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:35:36,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:35:36,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:35:36,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:35:36,518 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:35:36,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:35:36,520 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:35:36,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:35:36,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:35:36,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:35:36,522 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:35:36,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:35:36,523 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:35:36,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:35:36,524 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:35:36,524 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:35:36,525 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:35:36,525 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:35:36,525 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:35:36,526 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:35:36,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:35:36,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:35:36,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:35:36,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:35:36,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:36,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:35:36,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:35:36,528 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:35:36,529 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:35:36,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:35:36,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:35:36,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:35:36,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:35:36,530 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:35:36,530 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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/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 -> 22b4144b7005899e18ff8135fa52f12863f7106dbe1ddb808d25d8593c5f8fc4 [2023-11-29 00:35:36,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:35:36,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:35:36,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:35:36,833 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:35:36,833 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:35:36,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2023-11-29 00:35:39,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:35:39,905 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:35:39,906 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test7-1.i [2023-11-29 00:35:39,921 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data/60e31e014/b128695048794fe88476f3d980879030/FLAG351ba09b0 [2023-11-29 00:35:39,933 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/data/60e31e014/b128695048794fe88476f3d980879030 [2023-11-29 00:35:39,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:35:39,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:35:39,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:39,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:35:39,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:35:39,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:39" (1/1) ... [2023-11-29 00:35:39,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f6a9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:39, skipping insertion in model container [2023-11-29 00:35:39,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:35:39" (1/1) ... [2023-11-29 00:35:40,000 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:35:40,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:40,489 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:35:40,506 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:35:40,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:40,599 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:35:40,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:35:40,727 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:35:40,735 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:35:40,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40 WrapperNode [2023-11-29 00:35:40,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:35:40,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:35:40,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:35:40,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:35:40,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,830 INFO L138 Inliner]: procedures = 179, calls = 280, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1017 [2023-11-29 00:35:40,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:35:40,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:35:40,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:35:40,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:35:40,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,933 INFO L175 MemorySlicer]: Split 258 memory accesses to 4 slices as follows [2, 217, 34, 5]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 50, 4, 1]. [2023-11-29 00:35:40,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:40,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:41,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:41,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:35:41,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:35:41,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:35:41,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:35:41,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (1/1) ... [2023-11-29 00:35:41,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:35:41,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:35:41,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:35:41,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:35:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 00:35:41,079 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 00:35:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:35:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:35:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 00:35:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 00:35:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:35:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:35:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:35:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:35:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 00:35:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 00:35:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 00:35:41,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 00:35:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 00:35:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 00:35:41,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 00:35:41,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 00:35:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:35:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:35:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:35:41,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:35:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:35:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:35:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:35:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 00:35:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:35:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:35:41,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:35:41,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:35:41,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:35:41,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:35:41,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:35:41,313 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:35:41,316 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:35:41,340 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:41,374 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:41,396 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:41,418 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 00:35:45,397 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:35:45,565 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:35:45,566 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 00:35:45,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:35:45 BoogieIcfgContainer [2023-11-29 00:35:45,567 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:35:45,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:35:45,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:35:45,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:35:45,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:35:39" (1/3) ... [2023-11-29 00:35:45,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45caee22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:35:45, skipping insertion in model container [2023-11-29 00:35:45,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:35:40" (2/3) ... [2023-11-29 00:35:45,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45caee22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:35:45, skipping insertion in model container [2023-11-29 00:35:45,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:35:45" (3/3) ... [2023-11-29 00:35:45,575 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test7-1.i [2023-11-29 00:35:45,594 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:35:45,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2023-11-29 00:35:45,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:35:45,676 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;@43155a16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:35:45,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2023-11-29 00:35:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 422 states have (on average 2.537914691943128) internal successors, (1071), 949 states have internal predecessors, (1071), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 00:35:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:35:45,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:45,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:35:45,690 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:35:45,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 54702, now seen corresponding path program 1 times [2023-11-29 00:35:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167892822] [2023-11-29 00:35:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:45,709 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 00:35:45,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:45,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:45,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:45,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:35:45,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:45,946 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 00:35:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:35:45,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:45,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167892822] [2023-11-29 00:35:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167892822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:45,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:45,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:35:45,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667218341] [2023-11-29 00:35:45,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:45,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:45,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:45,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:46,000 INFO L87 Difference]: Start difference. First operand has 956 states, 422 states have (on average 2.537914691943128) internal successors, (1071), 949 states have internal predecessors, (1071), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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 00:35:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:47,616 INFO L93 Difference]: Finished difference Result 950 states and 1005 transitions. [2023-11-29 00:35:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:47,618 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 00:35:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:47,636 INFO L225 Difference]: With dead ends: 950 [2023-11-29 00:35:47,636 INFO L226 Difference]: Without dead ends: 949 [2023-11-29 00:35:47,637 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 00:35:47,641 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 881 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:47,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 561 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:35:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-11-29 00:35:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 940. [2023-11-29 00:35:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 424 states have (on average 2.330188679245283) internal successors, (988), 934 states have internal predecessors, (988), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:35:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 996 transitions. [2023-11-29 00:35:47,725 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 996 transitions. Word has length 2 [2023-11-29 00:35:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:47,726 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 996 transitions. [2023-11-29 00:35:47,726 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 00:35:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 996 transitions. [2023-11-29 00:35:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 00:35:47,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:47,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 00:35:47,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:47,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:47,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:35:47,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash 54703, now seen corresponding path program 1 times [2023-11-29 00:35:47,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19709173] [2023-11-29 00:35:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:47,930 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 00:35:47,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:47,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:47,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:48,041 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:35:48,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:48,054 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 00:35:48,064 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 00:35:48,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:48,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:48,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19709173] [2023-11-29 00:35:48,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19709173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:48,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:48,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:35:48,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115264137] [2023-11-29 00:35:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:48,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:48,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:48,068 INFO L87 Difference]: Start difference. First operand 940 states and 996 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 00:35:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:50,868 INFO L93 Difference]: Finished difference Result 1296 states and 1383 transitions. [2023-11-29 00:35:50,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:50,868 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 00:35:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:50,876 INFO L225 Difference]: With dead ends: 1296 [2023-11-29 00:35:50,876 INFO L226 Difference]: Without dead ends: 1296 [2023-11-29 00:35:50,876 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 00:35:50,878 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 385 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:50,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1208 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 00:35:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2023-11-29 00:35:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1109. [2023-11-29 00:35:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 594 states have (on average 2.3047138047138045) internal successors, (1369), 1103 states have internal predecessors, (1369), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:35:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1377 transitions. [2023-11-29 00:35:50,912 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1377 transitions. Word has length 2 [2023-11-29 00:35:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:50,912 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1377 transitions. [2023-11-29 00:35:50,912 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 00:35:50,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1377 transitions. [2023-11-29 00:35:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 00:35:50,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:50,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 00:35:50,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:35:51,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:51,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:35:51,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1020415880, now seen corresponding path program 1 times [2023-11-29 00:35:51,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:51,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027194038] [2023-11-29 00:35:51,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:51,116 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 00:35:51,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:51,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:51,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:51,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:35:51,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:51,278 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 00:35:51,284 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 00:35:51,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:35:51,368 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 00:35:51,388 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:35:51,389 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 00:35:51,410 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 00:35:51,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:51,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:51,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027194038] [2023-11-29 00:35:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027194038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:51,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:51,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992274077] [2023-11-29 00:35:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:51,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:35:51,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:51,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:35:51,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:35:51,413 INFO L87 Difference]: Start difference. First operand 1109 states and 1377 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 00:35:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:53,874 INFO L93 Difference]: Finished difference Result 1112 states and 1382 transitions. [2023-11-29 00:35:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:35:53,874 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 00:35:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:53,879 INFO L225 Difference]: With dead ends: 1112 [2023-11-29 00:35:53,880 INFO L226 Difference]: Without dead ends: 1112 [2023-11-29 00:35:53,880 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 00:35:53,881 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 966 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:53,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 282 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 00:35:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-11-29 00:35:53,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 929. [2023-11-29 00:35:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 424 states have (on average 2.30188679245283) internal successors, (976), 923 states have internal predecessors, (976), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:35:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 984 transitions. [2023-11-29 00:35:53,901 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 984 transitions. Word has length 6 [2023-11-29 00:35:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:53,902 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 984 transitions. [2023-11-29 00:35:53,902 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 00:35:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 984 transitions. [2023-11-29 00:35:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:35:53,903 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:53,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:53,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:54,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:54,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:35:54,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1568121198, now seen corresponding path program 1 times [2023-11-29 00:35:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423577695] [2023-11-29 00:35:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:54,106 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 00:35:54,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:54,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:54,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:54,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:35:54,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:54,212 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 00:35:54,224 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 00:35:54,224 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:54,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423577695] [2023-11-29 00:35:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423577695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:54,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:54,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339897290] [2023-11-29 00:35:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:54,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:54,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:54,237 INFO L87 Difference]: Start difference. First operand 929 states and 984 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 00:35:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:56,332 INFO L93 Difference]: Finished difference Result 1225 states and 1310 transitions. [2023-11-29 00:35:56,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:56,334 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 00:35:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:56,339 INFO L225 Difference]: With dead ends: 1225 [2023-11-29 00:35:56,339 INFO L226 Difference]: Without dead ends: 1225 [2023-11-29 00:35:56,339 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 00:35:56,340 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 881 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:56,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 971 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 00:35:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2023-11-29 00:35:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 882. [2023-11-29 00:35:56,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 424 states have (on average 2.1910377358490565) internal successors, (929), 876 states have internal predecessors, (929), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:35:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 937 transitions. [2023-11-29 00:35:56,360 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 937 transitions. Word has length 7 [2023-11-29 00:35:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:56,360 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 937 transitions. [2023-11-29 00:35:56,361 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 00:35:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 937 transitions. [2023-11-29 00:35:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 00:35:56,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:56,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:56,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:56,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:56,564 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:35:56,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:56,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1568121197, now seen corresponding path program 1 times [2023-11-29 00:35:56,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:56,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843104402] [2023-11-29 00:35:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:56,566 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 00:35:56,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:56,567 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:56,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:56,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:35:56,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:56,671 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 00:35:56,696 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 00:35:56,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:35:56,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:35:56,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843104402] [2023-11-29 00:35:56,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843104402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:35:56,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:35:56,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:35:56,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235898926] [2023-11-29 00:35:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:35:56,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:35:56,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:35:56,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:35:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:35:56,699 INFO L87 Difference]: Start difference. First operand 882 states and 937 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 00:35:59,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:35:59,555 INFO L93 Difference]: Finished difference Result 1295 states and 1383 transitions. [2023-11-29 00:35:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:35:59,556 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 00:35:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:35:59,561 INFO L225 Difference]: With dead ends: 1295 [2023-11-29 00:35:59,561 INFO L226 Difference]: Without dead ends: 1295 [2023-11-29 00:35:59,561 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 00:35:59,562 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 613 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:35:59,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1272 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 00:35:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-11-29 00:35:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 895. [2023-11-29 00:35:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 447 states have (on average 2.1834451901565997) internal successors, (976), 889 states have internal predecessors, (976), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:35:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 984 transitions. [2023-11-29 00:35:59,580 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 984 transitions. Word has length 7 [2023-11-29 00:35:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:35:59,580 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 984 transitions. [2023-11-29 00:35:59,580 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 00:35:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 984 transitions. [2023-11-29 00:35:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 00:35:59,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:35:59,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:35:59,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:59,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:59,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:35:59,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:35:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 4917671, now seen corresponding path program 1 times [2023-11-29 00:35:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:35:59,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418394911] [2023-11-29 00:35:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:35:59,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:35:59,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:35:59,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:59,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:35:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:35:59,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:35:59,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:35:59,962 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:35:59,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 00:35:59,965 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 33 treesize of output 31 [2023-11-29 00:36:00,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 00:36:00,008 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 62 treesize of output 22 [2023-11-29 00:36:00,029 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 00:36:00,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:00,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418394911] [2023-11-29 00:36:00,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418394911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:00,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737193154] [2023-11-29 00:36:00,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:00,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:00,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:00,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:00,032 INFO L87 Difference]: Start difference. First operand 895 states and 984 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:02,131 INFO L93 Difference]: Finished difference Result 1779 states and 1958 transitions. [2023-11-29 00:36:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 00:36:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:02,141 INFO L225 Difference]: With dead ends: 1779 [2023-11-29 00:36:02,141 INFO L226 Difference]: Without dead ends: 1779 [2023-11-29 00:36:02,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 00:36:02,142 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 898 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:02,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 2384 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 00:36:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2023-11-29 00:36:02,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 897. [2023-11-29 00:36:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 449 states have (on average 2.178173719376392) internal successors, (978), 891 states have internal predecessors, (978), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:02,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 986 transitions. [2023-11-29 00:36:02,168 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 986 transitions. Word has length 11 [2023-11-29 00:36:02,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:02,168 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 986 transitions. [2023-11-29 00:36:02,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 986 transitions. [2023-11-29 00:36:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 00:36:02,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:02,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:02,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:02,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:02,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:02,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1709168535, now seen corresponding path program 1 times [2023-11-29 00:36:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:02,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718243147] [2023-11-29 00:36:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:02,371 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 00:36:02,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:02,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:02,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:02,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:36:02,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:02,518 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 00:36:02,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:02,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718243147] [2023-11-29 00:36:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718243147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:02,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:02,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:02,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029393451] [2023-11-29 00:36:02,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:02,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:02,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:02,521 INFO L87 Difference]: Start difference. First operand 897 states and 986 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 00:36:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:03,203 INFO L93 Difference]: Finished difference Result 858 states and 946 transitions. [2023-11-29 00:36:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:03,205 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 00:36:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:03,208 INFO L225 Difference]: With dead ends: 858 [2023-11-29 00:36:03,208 INFO L226 Difference]: Without dead ends: 858 [2023-11-29 00:36:03,209 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 00:36:03,209 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 70 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1485 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 00:36:03,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1485 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 00:36:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-11-29 00:36:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2023-11-29 00:36:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 434 states have (on average 2.161290322580645) internal successors, (938), 852 states have internal predecessors, (938), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 946 transitions. [2023-11-29 00:36:03,233 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 946 transitions. Word has length 15 [2023-11-29 00:36:03,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:03,234 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 946 transitions. [2023-11-29 00:36:03,234 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 00:36:03,234 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 946 transitions. [2023-11-29 00:36:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 00:36:03,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:03,235 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 00:36:03,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:03,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:03,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:03,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1833457533, now seen corresponding path program 1 times [2023-11-29 00:36:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895872470] [2023-11-29 00:36:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:03,437 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 00:36:03,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:03,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:03,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:03,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:03,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:03,590 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 00:36:03,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:03,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895872470] [2023-11-29 00:36:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895872470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:03,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369381785] [2023-11-29 00:36:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:03,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:03,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:03,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:03,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:03,593 INFO L87 Difference]: Start difference. First operand 858 states and 946 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 00:36:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:04,464 INFO L93 Difference]: Finished difference Result 844 states and 925 transitions. [2023-11-29 00:36:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:04,466 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 00:36:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:04,469 INFO L225 Difference]: With dead ends: 844 [2023-11-29 00:36:04,469 INFO L226 Difference]: Without dead ends: 844 [2023-11-29 00:36:04,469 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 00:36:04,470 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 58 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2184 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.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:04,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2184 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 00:36:04,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2023-11-29 00:36:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 843. [2023-11-29 00:36:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 433 states have (on average 2.115473441108545) internal successors, (916), 837 states have internal predecessors, (916), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 924 transitions. [2023-11-29 00:36:04,483 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 924 transitions. Word has length 17 [2023-11-29 00:36:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:04,483 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 924 transitions. [2023-11-29 00:36:04,483 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 00:36:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 924 transitions. [2023-11-29 00:36:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:36:04,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:04,485 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 00:36:04,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:04,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:04,685 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:04,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash 308594481, now seen corresponding path program 1 times [2023-11-29 00:36:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732540196] [2023-11-29 00:36:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:04,686 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 00:36:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:04,687 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:04,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:04,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:36:04,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:04,851 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 00:36:04,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 00:36:04,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:04,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732540196] [2023-11-29 00:36:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732540196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908055359] [2023-11-29 00:36:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:04,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:04,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:04,922 INFO L87 Difference]: Start difference. First operand 843 states and 924 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 00:36:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:07,254 INFO L93 Difference]: Finished difference Result 1182 states and 1293 transitions. [2023-11-29 00:36:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:07,255 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 00:36:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:07,259 INFO L225 Difference]: With dead ends: 1182 [2023-11-29 00:36:07,259 INFO L226 Difference]: Without dead ends: 1182 [2023-11-29 00:36:07,260 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 00:36:07,260 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 814 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:07,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 956 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:36:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-11-29 00:36:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 839. [2023-11-29 00:36:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 433 states have (on average 2.1062355658198615) internal successors, (912), 833 states have internal predecessors, (912), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 920 transitions. [2023-11-29 00:36:07,279 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 920 transitions. Word has length 31 [2023-11-29 00:36:07,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:07,280 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 920 transitions. [2023-11-29 00:36:07,280 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 00:36:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 920 transitions. [2023-11-29 00:36:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 00:36:07,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:07,281 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 00:36:07,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:07,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:07,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:07,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 308594482, now seen corresponding path program 1 times [2023-11-29 00:36:07,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389384507] [2023-11-29 00:36:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:07,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 00:36:07,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:07,484 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:07,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:07,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:36:07,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:07,675 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 00:36:07,836 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 00:36:07,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:07,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389384507] [2023-11-29 00:36:07,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389384507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:07,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:07,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:07,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929401481] [2023-11-29 00:36:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:07,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:07,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:07,838 INFO L87 Difference]: Start difference. First operand 839 states and 920 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 00:36:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:10,975 INFO L93 Difference]: Finished difference Result 1235 states and 1315 transitions. [2023-11-29 00:36:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:10,977 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 00:36:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:10,981 INFO L225 Difference]: With dead ends: 1235 [2023-11-29 00:36:10,981 INFO L226 Difference]: Without dead ends: 1235 [2023-11-29 00:36:10,981 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 00:36:10,982 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 548 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:10,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1253 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 00:36:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2023-11-29 00:36:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 835. [2023-11-29 00:36:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 433 states have (on average 2.096997690531178) internal successors, (908), 829 states have internal predecessors, (908), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 916 transitions. [2023-11-29 00:36:10,999 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 916 transitions. Word has length 31 [2023-11-29 00:36:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:10,999 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 916 transitions. [2023-11-29 00:36:11,000 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 00:36:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 916 transitions. [2023-11-29 00:36:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 00:36:11,001 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:11,001 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] [2023-11-29 00:36:11,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:11,202 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:11,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1210445483, now seen corresponding path program 1 times [2023-11-29 00:36:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994741344] [2023-11-29 00:36:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:11,203 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 00:36:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:11,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:11,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:11,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:11,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:11,441 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 00:36:11,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:11,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:11,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994741344] [2023-11-29 00:36:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994741344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:11,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411444952] [2023-11-29 00:36:11,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:11,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:11,442 INFO L87 Difference]: Start difference. First operand 835 states and 916 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 00:36:12,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:12,386 INFO L93 Difference]: Finished difference Result 829 states and 906 transitions. [2023-11-29 00:36:12,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:12,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2023-11-29 00:36:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:12,392 INFO L225 Difference]: With dead ends: 829 [2023-11-29 00:36:12,392 INFO L226 Difference]: Without dead ends: 829 [2023-11-29 00:36:12,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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 00:36:12,393 INFO L413 NwaCegarLoop]: 730 mSDtfsCounter, 23 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2170 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.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:12,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2170 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:36:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2023-11-29 00:36:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2023-11-29 00:36:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 427 states have (on average 2.1030444964871196) internal successors, (898), 823 states have internal predecessors, (898), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 906 transitions. [2023-11-29 00:36:12,411 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 906 transitions. Word has length 47 [2023-11-29 00:36:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:12,412 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 906 transitions. [2023-11-29 00:36:12,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 00:36:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 906 transitions. [2023-11-29 00:36:12,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 00:36:12,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:12,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:12,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:12,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:12,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:12,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1449506260, now seen corresponding path program 1 times [2023-11-29 00:36:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187268484] [2023-11-29 00:36:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:12,620 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 00:36:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:12,621 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:12,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:12,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:12,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:13,080 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 00:36:13,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:13,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187268484] [2023-11-29 00:36:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187268484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:36:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513035410] [2023-11-29 00:36:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:13,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:36:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:36:13,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:36:13,082 INFO L87 Difference]: Start difference. First operand 829 states and 906 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 00:36:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:14,028 INFO L93 Difference]: Finished difference Result 1167 states and 1266 transitions. [2023-11-29 00:36:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:36:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2023-11-29 00:36:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:14,034 INFO L225 Difference]: With dead ends: 1167 [2023-11-29 00:36:14,034 INFO L226 Difference]: Without dead ends: 1167 [2023-11-29 00:36:14,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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 00:36:14,035 INFO L413 NwaCegarLoop]: 908 mSDtfsCounter, 368 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:14,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1526 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:36:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-11-29 00:36:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1002. [2023-11-29 00:36:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 600 states have (on average 2.045) internal successors, (1227), 996 states have internal predecessors, (1227), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1235 transitions. [2023-11-29 00:36:14,049 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1235 transitions. Word has length 51 [2023-11-29 00:36:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:14,049 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 1235 transitions. [2023-11-29 00:36:14,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 00:36:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1235 transitions. [2023-11-29 00:36:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 00:36:14,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:14,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:14,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:14,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:14,255 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:14,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash -747226817, now seen corresponding path program 1 times [2023-11-29 00:36:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:14,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527605855] [2023-11-29 00:36:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:14,257 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 00:36:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:14,258 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:14,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:14,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:36:14,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:14,553 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 00:36:14,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:36:15,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:36:15,059 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 00:36:15,070 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:36:15,071 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 00:36:15,084 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 00:36:15,085 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:15,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527605855] [2023-11-29 00:36:15,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527605855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:15,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:36:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643108988] [2023-11-29 00:36:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:15,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:15,088 INFO L87 Difference]: Start difference. First operand 1002 states and 1235 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:17,883 INFO L93 Difference]: Finished difference Result 1370 states and 1729 transitions. [2023-11-29 00:36:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:17,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 00:36:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:17,889 INFO L225 Difference]: With dead ends: 1370 [2023-11-29 00:36:17,889 INFO L226 Difference]: Without dead ends: 1370 [2023-11-29 00:36:17,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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 00:36:17,890 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1104 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:17,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 349 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 00:36:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2023-11-29 00:36:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 941. [2023-11-29 00:36:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 577 states have (on average 1.9618717504332757) internal successors, (1132), 935 states have internal predecessors, (1132), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1140 transitions. [2023-11-29 00:36:17,902 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1140 transitions. Word has length 54 [2023-11-29 00:36:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:17,903 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1140 transitions. [2023-11-29 00:36:17,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:36:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1140 transitions. [2023-11-29 00:36:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:36:17,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:17,904 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] [2023-11-29 00:36:17,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:18,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:18,104 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:18,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1674587914, now seen corresponding path program 1 times [2023-11-29 00:36:18,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:18,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849547829] [2023-11-29 00:36:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:18,106 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 00:36:18,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:18,106 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:18,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:18,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:36:18,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:18,345 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 00:36:18,357 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 00:36:18,378 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 00:36:18,388 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 00:36:18,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:18,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849547829] [2023-11-29 00:36:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849547829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:18,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:18,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:18,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136208895] [2023-11-29 00:36:18,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:18,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:18,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:18,390 INFO L87 Difference]: Start difference. First operand 941 states and 1140 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 00:36:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:20,764 INFO L93 Difference]: Finished difference Result 940 states and 1139 transitions. [2023-11-29 00:36:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:20,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-11-29 00:36:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:20,769 INFO L225 Difference]: With dead ends: 940 [2023-11-29 00:36:20,769 INFO L226 Difference]: Without dead ends: 940 [2023-11-29 00:36:20,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:20,770 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 3 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:20,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1817 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 00:36:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-29 00:36:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2023-11-29 00:36:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 577 states have (on average 1.9601386481802425) internal successors, (1131), 934 states have internal predecessors, (1131), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1139 transitions. [2023-11-29 00:36:20,786 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1139 transitions. Word has length 58 [2023-11-29 00:36:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:20,786 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1139 transitions. [2023-11-29 00:36:20,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 00:36:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1139 transitions. [2023-11-29 00:36:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 00:36:20,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:20,788 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] [2023-11-29 00:36:20,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:20,988 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:20,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1674587913, now seen corresponding path program 1 times [2023-11-29 00:36:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:20,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942776681] [2023-11-29 00:36:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:20,989 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 00:36:20,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:20,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:20,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:21,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 00:36:21,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:21,236 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 00:36:21,255 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 00:36:21,265 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 00:36:21,307 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 00:36:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:21,330 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:21,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:21,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942776681] [2023-11-29 00:36:21,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942776681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:21,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:21,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491613765] [2023-11-29 00:36:21,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:21,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:21,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:21,332 INFO L87 Difference]: Start difference. First operand 940 states and 1139 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 00:36:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:24,460 INFO L93 Difference]: Finished difference Result 939 states and 1138 transitions. [2023-11-29 00:36:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2023-11-29 00:36:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:24,466 INFO L225 Difference]: With dead ends: 939 [2023-11-29 00:36:24,466 INFO L226 Difference]: Without dead ends: 939 [2023-11-29 00:36:24,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:36:24,467 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:24,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1858 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 00:36:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-11-29 00:36:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2023-11-29 00:36:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 576 states have (on average 1.9618055555555556) internal successors, (1130), 933 states have internal predecessors, (1130), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 00:36:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1138 transitions. [2023-11-29 00:36:24,486 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1138 transitions. Word has length 58 [2023-11-29 00:36:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:24,486 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1138 transitions. [2023-11-29 00:36:24,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 00:36:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1138 transitions. [2023-11-29 00:36:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:36:24,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:24,487 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 00:36:24,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:24,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:24,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:24,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:24,688 INFO L85 PathProgramCache]: Analyzing trace with hash 604363738, now seen corresponding path program 1 times [2023-11-29 00:36:24,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:24,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519414471] [2023-11-29 00:36:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:24,689 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 00:36:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:24,690 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:24,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:24,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:36:24,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:24,992 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 00:36:24,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:24,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519414471] [2023-11-29 00:36:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519414471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:24,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:24,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:24,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085311407] [2023-11-29 00:36:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:24,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:24,994 INFO L87 Difference]: Start difference. First operand 939 states and 1138 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 00:36:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:25,936 INFO L93 Difference]: Finished difference Result 941 states and 1141 transitions. [2023-11-29 00:36:25,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:25,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2023-11-29 00:36:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:25,943 INFO L225 Difference]: With dead ends: 941 [2023-11-29 00:36:25,943 INFO L226 Difference]: Without dead ends: 941 [2023-11-29 00:36:25,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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 00:36:25,943 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 1 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:25,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2109 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 00:36:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2023-11-29 00:36:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2023-11-29 00:36:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 577 states have (on average 1.9618717504332757) internal successors, (1132), 935 states have internal predecessors, (1132), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:36:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1141 transitions. [2023-11-29 00:36:25,963 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1141 transitions. Word has length 64 [2023-11-29 00:36:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:25,964 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1141 transitions. [2023-11-29 00:36:25,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 00:36:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1141 transitions. [2023-11-29 00:36:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 00:36:25,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:25,964 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] [2023-11-29 00:36:25,969 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:26,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:26,165 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:26,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash 693896914, now seen corresponding path program 1 times [2023-11-29 00:36:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:26,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635179642] [2023-11-29 00:36:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:26,166 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 00:36:26,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:26,167 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:26,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:36:26,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:26,448 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 00:36:26,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:26,511 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 00:36:26,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635179642] [2023-11-29 00:36:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635179642] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:26,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:26,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 00:36:26,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979474361] [2023-11-29 00:36:26,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:26,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:36:26,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:26,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:36:26,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:26,513 INFO L87 Difference]: Start difference. First operand 941 states and 1141 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:28,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:28,039 INFO L93 Difference]: Finished difference Result 950 states and 1155 transitions. [2023-11-29 00:36:28,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:36:28,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 00:36:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:28,044 INFO L225 Difference]: With dead ends: 950 [2023-11-29 00:36:28,044 INFO L226 Difference]: Without dead ends: 950 [2023-11-29 00:36:28,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:36:28,045 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 6 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4208 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:28,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4208 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:36:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2023-11-29 00:36:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 949. [2023-11-29 00:36:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 584 states have (on average 1.9606164383561644) internal successors, (1145), 942 states have internal predecessors, (1145), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:36:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1154 transitions. [2023-11-29 00:36:28,058 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1154 transitions. Word has length 65 [2023-11-29 00:36:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:28,059 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1154 transitions. [2023-11-29 00:36:28,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1154 transitions. [2023-11-29 00:36:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 00:36:28,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:28,060 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] [2023-11-29 00:36:28,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:28,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:28,260 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:28,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash -575350310, now seen corresponding path program 2 times [2023-11-29 00:36:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890585626] [2023-11-29 00:36:28,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:36:28,262 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 00:36:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:28,263 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:28,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:28,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:36:28,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:28,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:36:28,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:28,726 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 00:36:28,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:28,855 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 00:36:28,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890585626] [2023-11-29 00:36:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890585626] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:28,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 00:36:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658859732] [2023-11-29 00:36:28,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:28,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 00:36:28,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:28,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 00:36:28,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:36:28,858 INFO L87 Difference]: Start difference. First operand 949 states and 1154 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:31,231 INFO L93 Difference]: Finished difference Result 964 states and 1176 transitions. [2023-11-29 00:36:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 00:36:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 00:36:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:31,237 INFO L225 Difference]: With dead ends: 964 [2023-11-29 00:36:31,237 INFO L226 Difference]: Without dead ends: 962 [2023-11-29 00:36:31,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 00:36:31,238 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 13 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4913 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:31,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4913 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 00:36:31,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2023-11-29 00:36:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 958. [2023-11-29 00:36:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 593 states have (on average 1.951096121416526) internal successors, (1157), 951 states have internal predecessors, (1157), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:36:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1166 transitions. [2023-11-29 00:36:31,256 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1166 transitions. Word has length 68 [2023-11-29 00:36:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:31,256 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1166 transitions. [2023-11-29 00:36:31,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1166 transitions. [2023-11-29 00:36:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 00:36:31,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:31,257 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] [2023-11-29 00:36:31,263 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:31,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:31,458 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:31,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:31,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2035599654, now seen corresponding path program 3 times [2023-11-29 00:36:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841534799] [2023-11-29 00:36:31,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:36:31,459 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 00:36:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:31,460 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:31,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:32,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 00:36:32,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:32,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 00:36:32,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:32,207 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 00:36:32,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:32,844 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 00:36:32,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:32,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841534799] [2023-11-29 00:36:32,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841534799] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:32,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:32,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 00:36:32,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667641775] [2023-11-29 00:36:32,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:32,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 00:36:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 00:36:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:36:32,846 INFO L87 Difference]: Start difference. First operand 958 states and 1166 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:38,119 INFO L93 Difference]: Finished difference Result 988 states and 1216 transitions. [2023-11-29 00:36:38,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 00:36:38,120 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-29 00:36:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:38,124 INFO L225 Difference]: With dead ends: 988 [2023-11-29 00:36:38,125 INFO L226 Difference]: Without dead ends: 985 [2023-11-29 00:36:38,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 00:36:38,126 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 25 mSDsluCounter, 7709 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8411 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:38,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8411 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-11-29 00:36:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-11-29 00:36:38,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 976. [2023-11-29 00:36:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 611 states have (on average 1.9312602291325696) internal successors, (1180), 969 states have internal predecessors, (1180), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:36:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1189 transitions. [2023-11-29 00:36:38,140 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1189 transitions. Word has length 74 [2023-11-29 00:36:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:38,140 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1189 transitions. [2023-11-29 00:36:38,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1189 transitions. [2023-11-29 00:36:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:36:38,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:38,141 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] [2023-11-29 00:36:38,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:38,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:38,341 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:38,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1140502746, now seen corresponding path program 4 times [2023-11-29 00:36:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:38,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444456575] [2023-11-29 00:36:38,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:36:38,343 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 00:36:38,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:38,344 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:38,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:38,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:36:38,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:38,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 00:36:38,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:39,065 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 00:36:39,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:40,616 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 00:36:40,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444456575] [2023-11-29 00:36:40,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444456575] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:36:40,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:36:40,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 00:36:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972296610] [2023-11-29 00:36:40,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:36:40,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 00:36:40,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:36:40,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 00:36:40,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 00:36:40,620 INFO L87 Difference]: Start difference. First operand 976 states and 1189 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:53,906 INFO L93 Difference]: Finished difference Result 1033 states and 1278 transitions. [2023-11-29 00:36:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 00:36:53,907 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2023-11-29 00:36:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:53,912 INFO L225 Difference]: With dead ends: 1033 [2023-11-29 00:36:53,912 INFO L226 Difference]: Without dead ends: 1031 [2023-11-29 00:36:53,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 00:36:53,917 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 47 mSDsluCounter, 18249 mSDsCounter, 0 mSdLazyCounter, 4909 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 18952 SdHoareTripleChecker+Invalid, 4967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:53,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 18952 Invalid, 4967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 4909 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-29 00:36:53,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-11-29 00:36:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1010. [2023-11-29 00:36:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 645 states have (on average 1.9007751937984496) internal successors, (1226), 1003 states have internal predecessors, (1226), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:36:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1235 transitions. [2023-11-29 00:36:53,938 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1235 transitions. Word has length 86 [2023-11-29 00:36:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:53,939 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 1235 transitions. [2023-11-29 00:36:53,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 00:36:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1235 transitions. [2023-11-29 00:36:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:36:53,940 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:53,940 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:53,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:54,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:54,141 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:36:54,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:54,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2037499354, now seen corresponding path program 5 times [2023-11-29 00:36:54,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:36:54,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784574508] [2023-11-29 00:36:54,142 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:36:54,142 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 00:36:54,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:36:54,143 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:54,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:36:55,425 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:36:55,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:36:55,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 00:36:55,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:55,462 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 00:36:55,548 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:36:55,549 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 00:36:55,575 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 00:36:55,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 00:36:56,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:36:56,435 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 00:36:56,469 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 00:36:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:36:56,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:36:56,896 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1997) |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 00:36:56,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:36:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784574508] [2023-11-29 00:36:56,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784574508] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:56,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1905081732] [2023-11-29 00:36:56,898 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:36:56,898 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:36:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:36:56,919 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:36:56,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 00:38:13,170 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 00:38:13,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:38:13,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 00:38:13,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:38:13,383 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 00:38:13,624 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:38:13,624 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 00:38:13,683 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 00:38:13,812 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 00:38:14,748 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:38:14,748 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 00:38:14,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:38:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:38:14,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:38:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1905081732] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:38:19,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:38:19,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 00:38:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149901393] [2023-11-29 00:38:19,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:38:19,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:38:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:38:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:38:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2023-11-29 00:38:19,269 INFO L87 Difference]: Start difference. First operand 1010 states and 1235 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:38:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:38:27,190 INFO L93 Difference]: Finished difference Result 1417 states and 1766 transitions. [2023-11-29 00:38:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:38:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 00:38:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:38:27,196 INFO L225 Difference]: With dead ends: 1417 [2023-11-29 00:38:27,196 INFO L226 Difference]: Without dead ends: 1415 [2023-11-29 00:38:27,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=210, Unknown=2, NotChecked=30, Total=306 [2023-11-29 00:38:27,197 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 704 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 3395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:38:27,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2977 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3395 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-11-29 00:38:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-11-29 00:38:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1009. [2023-11-29 00:38:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 645 states have (on average 1.8930232558139535) internal successors, (1221), 1002 states have internal predecessors, (1221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:38:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1230 transitions. [2023-11-29 00:38:27,216 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1230 transitions. Word has length 108 [2023-11-29 00:38:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:38:27,217 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1230 transitions. [2023-11-29 00:38:27,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:38:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1230 transitions. [2023-11-29 00:38:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 00:38:27,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:38:27,218 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:38:27,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:38:27,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2023-11-29 00:38:27,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:38:27,619 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:38:27,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:38:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2037499355, now seen corresponding path program 1 times [2023-11-29 00:38:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:38:27,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072222302] [2023-11-29 00:38:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:38:27,620 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 00:38:27,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:38:27,621 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:38:27,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:38:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:38:28,256 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 00:38:28,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:38:28,273 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 00:38:28,589 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 00:38:28,611 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:38:28,612 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 00:38:28,649 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 00:38:28,654 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 00:38:28,767 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 00:38:28,772 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 00:38:29,663 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:38:29,663 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 00:38:29,670 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 00:38:29,726 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 00:38:29,732 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 00:38:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:38:29,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:38:31,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3012) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 00:38:31,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:38:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072222302] [2023-11-29 00:38:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072222302] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:38:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1568892141] [2023-11-29 00:38:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:38:31,424 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:38:31,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:38:31,425 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:38:31,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 00:40:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:21,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 00:40:21,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:40:21,945 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 00:40:22,258 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 00:40:22,279 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:40:22,279 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 00:40:22,299 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 00:40:22,304 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 00:40:22,378 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 00:40:22,384 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 00:40:23,197 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:23,198 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 00:40:23,209 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 00:40:23,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 00:40:23,286 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 00:40:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:40:23,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:40:24,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3565) |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~mem36#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:40:24,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1568892141] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:40:24,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:40:24,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 00:40:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864867911] [2023-11-29 00:40:24,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:40:24,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:40:24,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:40:24,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:40:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 00:40:24,645 INFO L87 Difference]: Start difference. First operand 1009 states and 1230 transitions. Second operand has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 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 00:40:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:40:33,486 INFO L93 Difference]: Finished difference Result 1414 states and 1761 transitions. [2023-11-29 00:40:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:40:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 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 108 [2023-11-29 00:40:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:40:33,493 INFO L225 Difference]: With dead ends: 1414 [2023-11-29 00:40:33,494 INFO L226 Difference]: Without dead ends: 1414 [2023-11-29 00:40:33,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 00:40:33,494 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 660 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:40:33,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1753 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2023-11-29 00:40:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2023-11-29 00:40:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1008. [2023-11-29 00:40:33,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 645 states have (on average 1.8914728682170543) internal successors, (1220), 1001 states have internal predecessors, (1220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:40:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1229 transitions. [2023-11-29 00:40:33,508 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1229 transitions. Word has length 108 [2023-11-29 00:40:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:40:33,508 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1229 transitions. [2023-11-29 00:40:33,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 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 00:40:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1229 transitions. [2023-11-29 00:40:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:40:33,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:40:33,509 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:40:33,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 00:40:33,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:40:33,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:40:33,910 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:40:33,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:40:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -466880649, now seen corresponding path program 1 times [2023-11-29 00:40:33,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:40:33,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815712035] [2023-11-29 00:40:33,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:33,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 00:40:33,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:40:33,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:40:33,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:40:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:34,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 00:40:34,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:40:34,698 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 00:40:34,853 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:40:34,854 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 00:40:34,891 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 00:40:35,004 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 00:40:35,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:40:35,986 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 00:40:36,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:40:36,104 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 00:40:36,120 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 00:40:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:40:36,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:40:37,195 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3988 (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_3988) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:40:37,576 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4034 (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~mem36#1.base| v_ArrVal_4034))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:40:37,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:40:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815712035] [2023-11-29 00:40:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815712035] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:40:37,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1277479847] [2023-11-29 00:40:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:37,579 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:40:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:40:37,580 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:40:37,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 00:40:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:41,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 00:40:41,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:40:41,386 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 00:40:41,770 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:40:41,771 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 00:40:41,852 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 00:40:42,082 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 00:40:42,969 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:42,969 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 00:40:43,149 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:43,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 00:40:43,166 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 00:40:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:40:43,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:40:43,741 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4503 (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~mem36#1.base| v_ArrVal_4503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3988)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:40:43,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1277479847] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:40:43,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:40:43,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 00:40:43,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68587034] [2023-11-29 00:40:43,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:40:43,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:40:43,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:40:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:40:43,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=240, Unknown=5, NotChecked=102, Total=420 [2023-11-29 00:40:43,746 INFO L87 Difference]: Start difference. First operand 1008 states and 1229 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:40:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:40:53,524 INFO L93 Difference]: Finished difference Result 1413 states and 1760 transitions. [2023-11-29 00:40:53,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:40:53,526 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 00:40:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:40:53,532 INFO L225 Difference]: With dead ends: 1413 [2023-11-29 00:40:53,532 INFO L226 Difference]: Without dead ends: 1413 [2023-11-29 00:40:53,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=82, Invalid=267, Unknown=5, NotChecked=108, Total=462 [2023-11-29 00:40:53,533 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 699 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:40:53,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 3386 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-11-29 00:40:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2023-11-29 00:40:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1007. [2023-11-29 00:40:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 645 states have (on average 1.889922480620155) internal successors, (1219), 1000 states have internal predecessors, (1219), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:40:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1228 transitions. [2023-11-29 00:40:53,545 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1228 transitions. Word has length 110 [2023-11-29 00:40:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:40:53,546 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1228 transitions. [2023-11-29 00:40:53,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:40:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1228 transitions. [2023-11-29 00:40:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 00:40:53,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:40:53,547 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:40:53,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:40:53,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 00:40:53,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:40:53,947 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:40:53,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:40:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash -466880648, now seen corresponding path program 1 times [2023-11-29 00:40:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:40:53,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845049923] [2023-11-29 00:40:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:53,949 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 00:40:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:40:53,949 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:40:53,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:40:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:40:54,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 00:40:54,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:40:54,725 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 00:40:55,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:40:55,075 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:40:55,076 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 00:40:55,107 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 00:40:55,119 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 00:40:55,247 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 00:40:55,252 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 00:40:56,066 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:56,066 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 00:40:56,072 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 00:40:56,193 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:40:56,193 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 00:40:56,202 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 00:40:56,220 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 00:40:56,226 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 00:40:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:40:56,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:40:56,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4971) |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~mem38#1.base| v_ArrVal_4972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4971) |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 00:40:56,446 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_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:40:57,761 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5063) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5064) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4971 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5064))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5063) .cse2 v_ArrVal_4971) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:40:57,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:40:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845049923] [2023-11-29 00:40:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845049923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:40:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [76262718] [2023-11-29 00:40:57,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:40:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:40:57,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:40:57,771 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:40:57,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 00:41:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:01,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 00:41:01,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:01,449 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 00:41:01,727 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:41:01,727 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 00:41:01,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:41:01,750 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 00:41:01,756 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 00:41:01,812 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 00:41:01,816 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 00:41:02,534 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:02,534 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 00:41:02,543 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 00:41:02,630 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:02,630 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 00:41:02,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 00:41:02,652 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 00:41:02,659 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 00:41:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:41:02,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:02,721 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 00:41:02,758 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_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:41:04,098 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5624) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5625) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5624 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5532 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5625))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5624) .cse2 v_ArrVal_5532) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5533) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:41:04,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [76262718] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:04,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:41:04,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 00:41:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604143029] [2023-11-29 00:41:04,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:41:04,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:41:04,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:41:04,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:41:04,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 00:41:04,109 INFO L87 Difference]: Start difference. First operand 1007 states and 1228 transitions. Second operand has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 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 00:41:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:13,426 INFO L93 Difference]: Finished difference Result 1412 states and 1759 transitions. [2023-11-29 00:41:13,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:41:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 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 110 [2023-11-29 00:41:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:13,432 INFO L225 Difference]: With dead ends: 1412 [2023-11-29 00:41:13,432 INFO L226 Difference]: Without dead ends: 1412 [2023-11-29 00:41:13,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 00:41:13,433 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 658 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:13,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1756 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3542 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 00:41:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2023-11-29 00:41:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1006. [2023-11-29 00:41:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 645 states have (on average 1.8883720930232557) internal successors, (1218), 999 states have internal predecessors, (1218), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:41:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1227 transitions. [2023-11-29 00:41:13,447 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1227 transitions. Word has length 110 [2023-11-29 00:41:13,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:13,447 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1227 transitions. [2023-11-29 00:41:13,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 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 00:41:13,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1227 transitions. [2023-11-29 00:41:13,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:41:13,448 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:13,448 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] [2023-11-29 00:41:13,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:41:13,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 00:41:13,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:41:13,849 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:41:13,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:13,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1994382353, now seen corresponding path program 1 times [2023-11-29 00:41:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:41:13,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142788219] [2023-11-29 00:41:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:13,850 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 00:41:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:41:13,851 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:41:13,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:41:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:14,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 00:41:14,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:14,801 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 00:41:14,976 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:41:14,976 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 00:41:15,024 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 00:41:15,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 24 treesize of output 12 [2023-11-29 00:41:16,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:41:16,295 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 00:41:16,437 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:41:16,437 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 00:41:16,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:41:16,531 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 00:41:16,544 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 00:41:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:41:16,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:16,644 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (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~mem39#1.base| v_ArrVal_6064) |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 00:41:16,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6064 (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_6064) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:41:16,675 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6064 (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~mem38#1.base| v_ArrVal_6063))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6064)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:41:17,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:41:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142788219] [2023-11-29 00:41:17,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142788219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:17,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [33439342] [2023-11-29 00:41:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:17,247 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:41:17,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:41:17,248 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:41:17,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 00:41:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:33,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 00:41:33,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:33,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:41:33,924 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:41:33,925 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 00:41:33,989 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 00:41:34,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 00:41:35,044 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:35,045 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 00:41:35,259 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:35,260 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 00:41:35,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:35,393 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 00:41:35,410 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 00:41:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:41:35,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:36,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6550 (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_6550) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:41:36,274 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6550 (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~mem38#1.base| v_ArrVal_6549))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6550)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:41:36,290 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6550 (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_6549))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6550)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:41:36,697 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6550 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6596 (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~mem36#1.base| v_ArrVal_6596))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6549)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6550)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:41:36,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [33439342] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:36,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:41:36,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 00:41:36,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414406465] [2023-11-29 00:41:36,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:41:36,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 00:41:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:41:36,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 00:41:36,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=369, Unknown=13, NotChecked=322, Total=812 [2023-11-29 00:41:36,702 INFO L87 Difference]: Start difference. First operand 1006 states and 1227 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:41:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:41:45,521 INFO L93 Difference]: Finished difference Result 1411 states and 1758 transitions. [2023-11-29 00:41:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 00:41:45,523 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 00:41:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:41:45,526 INFO L225 Difference]: With dead ends: 1411 [2023-11-29 00:41:45,526 INFO L226 Difference]: Without dead ends: 1411 [2023-11-29 00:41:45,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=118, Invalid=403, Unknown=13, NotChecked=336, Total=870 [2023-11-29 00:41:45,527 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 697 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:41:45,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3018 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-29 00:41:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2023-11-29 00:41:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1005. [2023-11-29 00:41:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 645 states have (on average 1.8868217054263565) internal successors, (1217), 998 states have internal predecessors, (1217), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:41:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1226 transitions. [2023-11-29 00:41:45,544 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1226 transitions. Word has length 112 [2023-11-29 00:41:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:41:45,544 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1226 transitions. [2023-11-29 00:41:45,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:41:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1226 transitions. [2023-11-29 00:41:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 00:41:45,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:41:45,545 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] [2023-11-29 00:41:45,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-11-29 00:41:45,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 00:41:45,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:41:45,946 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:41:45,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:41:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1994382352, now seen corresponding path program 1 times [2023-11-29 00:41:45,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:41:45,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272005044] [2023-11-29 00:41:45,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:45,947 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 00:41:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:41:45,948 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:41:45,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:41:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:41:46,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 00:41:46,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:41:46,875 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 00:41:47,125 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 00:41:47,138 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:41:47,138 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 00:41:47,166 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 00:41:47,173 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 00:41:47,290 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 00:41:47,294 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 00:41:48,003 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:48,004 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 00:41:48,009 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 00:41:48,138 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:48,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 00:41:48,147 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 00:41:48,245 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:41:48,245 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 00:41:48,253 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 00:41:48,269 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 00:41:48,274 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 00:41:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:41:48,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:41:48,471 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7082) |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~mem39#1.base| v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:41:48,504 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_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:41:48,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7079))) (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~mem38#1.base| v_ArrVal_7080) .cse0 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7080) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7082) |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 00:41:48,618 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_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7079))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7080) .cse1 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7080) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2023-11-29 00:41:51,109 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7174))) (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~mem36#1.base| v_ArrVal_7173) .cse1 v_ArrVal_7080) (select (select (store .cse2 .cse1 v_ArrVal_7079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7082))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7174 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7079 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7174))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7079))) (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~mem36#1.base| v_ArrVal_7173) .cse4 v_ArrVal_7080) .cse5 v_ArrVal_7082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7081) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:41:51,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:41:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272005044] [2023-11-29 00:41:51,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272005044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:41:51,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1837690587] [2023-11-29 00:41:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:41:51,128 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:41:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:41:51,129 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:41:51,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 00:42:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:08,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 00:42:08,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:42:08,414 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 00:42:08,971 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:42:08,971 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 00:42:08,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:42:09,009 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 00:42:09,029 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 00:42:09,139 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 00:42:09,147 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 00:42:10,300 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:42:10,300 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 00:42:10,314 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 00:42:10,458 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:42:10,458 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 00:42:10,467 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 00:42:10,562 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:42:10,562 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 00:42:10,576 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 00:42:10,602 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 00:42:10,610 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 00:42:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:42:10,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:42:10,690 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7659) |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~mem39#1.base| v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:42:10,746 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_7659 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:42:10,837 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7657) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7658))) (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~mem38#1.base| v_ArrVal_7657) .cse2 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:42:10,906 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_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7658))) (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_7657) .cse1 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7657) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 00:42:13,013 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7660 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7751))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7658))) (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~mem36#1.base| v_ArrVal_7752) .cse0 v_ArrVal_7657) .cse1 v_ArrVal_7659) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7660) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7658 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7657 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7751 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7751))) (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~mem36#1.base| v_ArrVal_7752) .cse6 v_ArrVal_7657) (select (select (store .cse7 .cse6 v_ArrVal_7658) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7659))) |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 00:42:13,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1837690587] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:13,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:42:13,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 00:42:13,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810808608] [2023-11-29 00:42:13,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:42:13,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:42:13,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:42:13,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:42:13,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=134, Unknown=10, NotChecked=310, Total=506 [2023-11-29 00:42:13,032 INFO L87 Difference]: Start difference. First operand 1005 states and 1226 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 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 00:42:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:42:32,097 INFO L93 Difference]: Finished difference Result 1410 states and 1757 transitions. [2023-11-29 00:42:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:42:32,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 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 112 [2023-11-29 00:42:32,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:42:32,107 INFO L225 Difference]: With dead ends: 1410 [2023-11-29 00:42:32,107 INFO L226 Difference]: Without dead ends: 1410 [2023-11-29 00:42:32,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=90, Invalid=282, Unknown=10, NotChecked=430, Total=812 [2023-11-29 00:42:32,108 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 653 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 4680 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 4686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:42:32,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 2198 Invalid, 4686 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 4680 Invalid, 0 Unknown, 0 Unchecked, 18.5s Time] [2023-11-29 00:42:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2023-11-29 00:42:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1004. [2023-11-29 00:42:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 645 states have (on average 1.8852713178294573) internal successors, (1216), 997 states have internal predecessors, (1216), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:42:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1225 transitions. [2023-11-29 00:42:32,121 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1225 transitions. Word has length 112 [2023-11-29 00:42:32,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:42:32,122 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1225 transitions. [2023-11-29 00:42:32,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 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 00:42:32,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1225 transitions. [2023-11-29 00:42:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 00:42:32,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:42:32,123 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] [2023-11-29 00:42:32,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 00:42:32,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 00:42:32,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 00:42:32,523 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:42:32,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:42:32,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1044710207, now seen corresponding path program 1 times [2023-11-29 00:42:32,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:42:32,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770301232] [2023-11-29 00:42:32,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:32,525 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 00:42:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:42:32,525 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:42:32,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:42:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:42:33,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 00:42:33,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:42:33,761 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 00:42:34,081 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:42:34,081 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 00:42:34,133 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 00:42:34,315 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 00:42:35,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:42:35,760 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 00:42:35,975 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:42:35,975 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 00:42:36,148 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:42:36,149 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 00:42:36,351 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:42:36,351 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 00:42:36,375 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 00:42:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:42:36,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:42:40,688 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:42:40,711 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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~mem39#1.base| v_ArrVal_8206))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:42:40,735 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (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_8206))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:42:40,762 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ 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| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8205))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:42:40,795 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ 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_8205))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:42:41,351 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8205 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ 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 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8253))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8205)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8206)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:42:41,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:42:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770301232] [2023-11-29 00:42:41,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770301232] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:42:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [178711166] [2023-11-29 00:42:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:42:41,358 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:42:41,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:42:41,359 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:42:41,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 00:43:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:01,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 00:43:01,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:01,317 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 00:43:01,983 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:43:01,983 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 00:43:02,094 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 00:43:02,426 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 00:43:03,887 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:03,887 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 00:43:04,218 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:04,218 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 00:43:04,436 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:04,436 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 00:43:04,677 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:43:04,678 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 00:43:04,701 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 00:43:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:43:04,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:06,203 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (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~mem39#1.base| v_ArrVal_8707))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:43:06,226 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (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_8707))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:43:06,252 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (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~mem38#1.base| v_ArrVal_8706))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8707)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:43:06,279 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8706))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8707)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:43:06,850 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8706 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8754 (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~mem36#1.base| v_ArrVal_8754))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8706)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8707)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8207)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:43:06,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [178711166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:06,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:43:06,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 00:43:06,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444310259] [2023-11-29 00:43:06,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:43:06,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:43:06,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:43:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:43:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=378, Unknown=14, NotChecked=550, Total=1056 [2023-11-29 00:43:06,859 INFO L87 Difference]: Start difference. First operand 1004 states and 1225 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:43:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:43:19,196 INFO L93 Difference]: Finished difference Result 1409 states and 1756 transitions. [2023-11-29 00:43:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:43:19,198 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 00:43:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:43:19,203 INFO L225 Difference]: With dead ends: 1409 [2023-11-29 00:43:19,203 INFO L226 Difference]: Without dead ends: 1409 [2023-11-29 00:43:19,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=123, Invalid=413, Unknown=14, NotChecked=572, Total=1122 [2023-11-29 00:43:19,204 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 691 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:43:19,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 2650 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2023-11-29 00:43:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2023-11-29 00:43:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1003. [2023-11-29 00:43:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 645 states have (on average 1.8837209302325582) internal successors, (1215), 996 states have internal predecessors, (1215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:43:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1224 transitions. [2023-11-29 00:43:19,221 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1224 transitions. Word has length 114 [2023-11-29 00:43:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:43:19,222 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1224 transitions. [2023-11-29 00:43:19,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:43:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1224 transitions. [2023-11-29 00:43:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 00:43:19,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:43:19,222 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] [2023-11-29 00:43:19,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 00:43:19,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 00:43:19,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:43:19,623 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:43:19,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:43:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1044710206, now seen corresponding path program 1 times [2023-11-29 00:43:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:43:19,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171932114] [2023-11-29 00:43:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:19,624 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 00:43:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:43:19,625 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:43:19,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:43:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:20,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 00:43:20,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:20,854 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 00:43:21,134 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:43:21,135 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 00:43:21,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:43:21,201 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 00:43:21,210 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 00:43:21,424 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 00:43:21,432 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 00:43:22,622 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:22,623 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 00:43:22,631 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 00:43:22,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:22,844 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 00:43:22,853 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 00:43:23,004 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:23,005 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 00:43:23,014 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 00:43:23,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:43:23,172 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 00:43:23,181 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 00:43:23,216 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 00:43:23,228 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 00:43:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:43:23,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:43:23,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9257) |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~mem40#1.base| v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:43:23,571 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_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9257) |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_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9257) |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 00:43:23,696 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9255) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9254) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9254))) (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~mem39#1.base| v_ArrVal_9255) .cse2 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:43:23,798 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_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9254))) (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_9255) .cse1 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9255) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9254) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9257) |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 00:43:25,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9253))) (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~mem38#1.base| v_ArrVal_9252) .cse1 v_ArrVal_9255) (select (select (store .cse2 .cse1 v_ArrVal_9254) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9257))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9253))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9254))) (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~mem38#1.base| v_ArrVal_9252) .cse4 v_ArrVal_9255) .cse5 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:43:27,156 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_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9253))) (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_9252) .cse2 v_ArrVal_9255) (select (select (store .cse3 .cse2 v_ArrVal_9254) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9257))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9253))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9254))) (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_9252) .cse5 v_ArrVal_9255) .cse6 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 00:43:33,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9348))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9253))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9254))) (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~mem36#1.base| v_ArrVal_9349) .cse0 v_ArrVal_9252) .cse1 v_ArrVal_9255) .cse2 v_ArrVal_9257) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9256) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9253 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9252 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9257 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9348))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9253))) (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~mem36#1.base| v_ArrVal_9349) .cse8 v_ArrVal_9252) .cse9 v_ArrVal_9255) (select (select (store .cse10 .cse9 v_ArrVal_9254) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9257))))) |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 00:43:33,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:43:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171932114] [2023-11-29 00:43:33,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171932114] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:43:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [154699837] [2023-11-29 00:43:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:43:33,336 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:43:33,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:43:33,342 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:43:33,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 00:43:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:43:54,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 00:43:54,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:43:54,441 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 00:43:56,355 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 00:43:56,451 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 00:43:56,451 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 00:43:56,771 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 00:43:56,806 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 00:43:57,668 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 00:43:57,687 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 00:44:01,171 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:01,171 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 00:44:01,216 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 00:44:02,086 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:02,087 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 00:44:02,123 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 00:44:02,691 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:02,691 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 00:44:02,727 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 00:44:03,284 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:44:03,285 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 00:44:03,322 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 00:44:03,396 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 00:44:03,415 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 00:44:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:44:03,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:44:03,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9851) |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~mem40#1.base| v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 00:44:03,711 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_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9851) |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_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 00:44:03,825 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9850) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9849))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9850) .cse2 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 00:44:03,928 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_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9850) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9849))) (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_9850) .cse3 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 00:44:07,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9847))) (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~mem38#1.base| v_ArrVal_9848) .cse1 v_ArrVal_9850) (select (select (store .cse2 .cse1 v_ArrVal_9849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9851))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9847))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9849))) (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~mem38#1.base| v_ArrVal_9848) .cse4 v_ArrVal_9850) .cse5 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 00:44:08,429 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9847))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9849))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9848) .cse1 v_ArrVal_9850) .cse2 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9847))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9848) .cse7 v_ArrVal_9850) (select (select (store .cse8 .cse7 v_ArrVal_9849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9851))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 00:44:15,903 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9944 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9943))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9847))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9849))) (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~mem36#1.base| v_ArrVal_9944) .cse0 v_ArrVal_9848) .cse1 v_ArrVal_9850) .cse2 v_ArrVal_9851) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9944 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9850 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9943))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9847))) (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~mem36#1.base| v_ArrVal_9944) .cse8 v_ArrVal_9848) .cse9 v_ArrVal_9850) (select (select (store .cse10 .cse9 v_ArrVal_9849) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9851))))) |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 00:44:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [154699837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:44:15,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:44:15,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 00:44:15,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94458319] [2023-11-29 00:44:15,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:44:15,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:44:15,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:44:15,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:44:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 00:44:15,935 INFO L87 Difference]: Start difference. First operand 1003 states and 1224 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:45:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:45:24,712 INFO L93 Difference]: Finished difference Result 1408 states and 1755 transitions. [2023-11-29 00:45:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:45:24,715 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 00:45:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:45:24,718 INFO L225 Difference]: With dead ends: 1408 [2023-11-29 00:45:24,718 INFO L226 Difference]: Without dead ends: 1408 [2023-11-29 00:45:24,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 00:45:24,719 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 699 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 6182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 6190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 6182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:45:24,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 2707 Invalid, 6190 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 6182 Invalid, 0 Unknown, 0 Unchecked, 67.0s Time] [2023-11-29 00:45:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-11-29 00:45:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1002. [2023-11-29 00:45:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 645 states have (on average 1.882170542635659) internal successors, (1214), 995 states have internal predecessors, (1214), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:45:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1223 transitions. [2023-11-29 00:45:24,734 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1223 transitions. Word has length 114 [2023-11-29 00:45:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:45:24,734 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 1223 transitions. [2023-11-29 00:45:24,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:45:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1223 transitions. [2023-11-29 00:45:24,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 00:45:24,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:45:24,735 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] [2023-11-29 00:45:24,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 00:45:24,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:45:25,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:45:25,136 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:45:25,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:45:25,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1057192679, now seen corresponding path program 1 times [2023-11-29 00:45:25,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:45:25,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346176710] [2023-11-29 00:45:25,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:25,137 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 00:45:25,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:45:25,138 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:45:25,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:45:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:26,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 00:45:26,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:26,664 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 00:45:27,882 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:45:27,882 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 00:45:28,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 00:45:28,619 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 00:45:33,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:33,489 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 00:45:34,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:34,159 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 00:45:34,647 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:34,647 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 00:45:35,157 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:35,157 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 00:45:35,685 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:45:35,685 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 00:45:35,753 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 00:45:35,986 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 00:45:35,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 00:45:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:45:36,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:45:36,891 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10417) |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 00:45:36,947 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10417) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 00:45:37,004 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10416))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:45:37,059 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 00:45:37,119 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10415))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:45:37,179 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:45:37,242 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10414))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 00:45:37,311 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10414))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 00:45:38,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10464 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10416 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10417 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10464))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10414)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10415)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10416)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10417)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 00:45:38,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:45:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346176710] [2023-11-29 00:45:38,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346176710] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:45:38,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [343487664] [2023-11-29 00:45:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:45:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:45:38,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:45:38,771 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:45:38,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 00:45:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:45:48,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 00:45:48,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:45:48,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:45:51,263 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:45:51,263 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 00:45:51,624 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 00:45:52,695 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 00:45:58,914 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:45:58,915 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 00:45:59,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:45:59,953 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 00:46:00,639 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:46:00,639 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 00:46:01,317 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:46:01,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 36 treesize of output 35 [2023-11-29 00:46:02,058 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 00:46:02,059 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 00:46:02,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 00:46:02,513 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 00:46:02,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 00:46:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:46:02,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:46:07,282 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10937) |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 00:46:07,377 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (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_10937) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:46:07,456 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (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~mem40#1.base| v_ArrVal_10936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:46:07,534 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (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_10936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 00:46:07,617 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (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~mem39#1.base| v_ArrVal_10935))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:46:07,701 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (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_10935))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))))) is different from false [2023-11-29 00:46:07,788 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10934 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (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~mem38#1.base| v_ArrVal_10934))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10935)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:46:07,881 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10938 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10935 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10936 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10934 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10938) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10934))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10935)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10936)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10937)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 00:46:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [343487664] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:46:09,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:46:09,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 00:46:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534715053] [2023-11-29 00:46:09,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:46:09,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 00:46:09,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:46:09,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 00:46:09,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=590, Unknown=18, NotChecked=1122, Total=1892 [2023-11-29 00:46:09,802 INFO L87 Difference]: Start difference. First operand 1002 states and 1223 transitions. Second operand has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:47:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:47:00,139 INFO L93 Difference]: Finished difference Result 1407 states and 1754 transitions. [2023-11-29 00:47:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:47:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2023-11-29 00:47:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:47:00,145 INFO L225 Difference]: With dead ends: 1407 [2023-11-29 00:47:00,145 INFO L226 Difference]: Without dead ends: 1407 [2023-11-29 00:47:00,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=172, Invalid=634, Unknown=18, NotChecked=1156, Total=1980 [2023-11-29 00:47:00,146 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 1323 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 4496 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 3837 SdHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:47:00,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 3837 Invalid, 4510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [14 Valid, 4496 Invalid, 0 Unknown, 0 Unchecked, 49.9s Time] [2023-11-29 00:47:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2023-11-29 00:47:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1001. [2023-11-29 00:47:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 645 states have (on average 1.8806201550387598) internal successors, (1213), 994 states have internal predecessors, (1213), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 00:47:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1222 transitions. [2023-11-29 00:47:00,161 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1222 transitions. Word has length 116 [2023-11-29 00:47:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:47:00,162 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1222 transitions. [2023-11-29 00:47:00,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 00:47:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1222 transitions. [2023-11-29 00:47:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 00:47:00,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:47:00,163 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] [2023-11-29 00:47:00,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 00:47:00,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:47:00,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:47:00,564 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 00:47:00,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:47:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1057192680, now seen corresponding path program 1 times [2023-11-29 00:47:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:47:00,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659552199] [2023-11-29 00:47:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:47:00,565 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 00:47:00,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:47:00,566 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:47:00,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 00:47:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:47:02,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 00:47:02,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:47:02,213 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 00:47:03,400 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:47:03,400 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 00:47:03,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:47:03,686 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 00:47:03,771 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 00:47:04,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 00:47:04,585 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 00:47:12,071 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:47:12,071 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 75 treesize of output 68 [2023-11-29 00:47:12,097 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 00:47:12,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:47:12,996 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 75 treesize of output 68 [2023-11-29 00:47:13,085 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 00:47:13,673 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:47:13,673 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 75 treesize of output 68 [2023-11-29 00:47:13,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 00:47:14,380 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:47:14,381 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 75 treesize of output 68 [2023-11-29 00:47:14,407 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 00:47:15,066 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 00:47:15,067 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 75 treesize of output 68 [2023-11-29 00:47:15,154 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 00:47:15,252 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 44 treesize of output 20 [2023-11-29 00:47:15,277 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 00:47:15,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:47:15,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 00:47:15,529 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 00:47:15,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 00:47:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 00:47:15,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:47:18,358 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_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))) (forall ((v_ArrVal_11508 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))) (forall ((v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))))) is different from false [2023-11-29 00:47:18,512 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))) (forall ((v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11505) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11504))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11505) .cse2 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store .cse3 .cse2 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))))))) is different from false [2023-11-29 00:47:18,696 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_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))) (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11504))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11505) .cse1 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store .cse3 .cse1 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))) (forall ((v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11505) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd (_ bv4 32) .cse4)))))))) is different from false [2023-11-29 00:47:18,860 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))) (forall ((v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11502))) (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~mem39#1.base| v_ArrVal_11503) .cse1 v_ArrVal_11505) (select (select (store .cse2 .cse1 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11507))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11502))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11504))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11503) .cse4 v_ArrVal_11505) .cse5 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store .cse6 .cse5 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))))))) is different from false [2023-11-29 00:47:23,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11502))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11504))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11503) .cse1 v_ArrVal_11505) .cse2 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store .cse4 .cse2 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))))) (or (forall ((v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11502))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11503) .cse7 v_ArrVal_11505) (select (select (store .cse8 .cse7 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11507))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))))))) is different from false [2023-11-29 00:47:23,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))) (forall ((v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11500))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_11502))) (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~mem38#1.base| v_ArrVal_11501) .cse1 v_ArrVal_11503) .cse2 v_ArrVal_11505) (select (select (store .cse3 .cse2 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11507))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11500))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_11502))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_11504))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11501) .cse6 v_ArrVal_11503) .cse7 v_ArrVal_11505) .cse8 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store .cse9 .cse8 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))))))) is different from false [2023-11-29 00:47:23,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (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|) .cse5))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))) (forall ((v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11500))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11502))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11501) .cse2 v_ArrVal_11503) .cse3 v_ArrVal_11505) (select (select (store .cse4 .cse3 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11507))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))) (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11500))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_11502))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11504))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11501) .cse7 v_ArrVal_11503) .cse8 v_ArrVal_11505) .cse9 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store .cse10 .cse9 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))))))))) is different from false [2023-11-29 00:47:27,493 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|)))) (forall ((v_ArrVal_11599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11600))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11500))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11502))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11599) .cse1 v_ArrVal_11501) .cse2 v_ArrVal_11503) .cse3 v_ArrVal_11505) (select (select (store .cse4 .cse3 v_ArrVal_11504) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11507))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_18| (_ BitVec 32)) (v_ArrVal_11599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11503 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11504 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11502 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11506 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_18|))) (forall ((v_ArrVal_11508 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11600))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_11500))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_11502))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_11504))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11599) .cse8 v_ArrVal_11501) .cse9 v_ArrVal_11503) .cse10 v_ArrVal_11505) .cse11 v_ArrVal_11507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc43#1.base_18| v_ArrVal_11508) (select (select (store .cse12 .cse11 v_ArrVal_11506) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))))))) is different from false [2023-11-29 00:47:27,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:47:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659552199] [2023-11-29 00:47:27,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659552199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:47:27,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1359382328] [2023-11-29 00:47:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:47:27,548 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 00:47:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 00:47:27,549 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 00:47:27,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_317fe90a-0bdc-4627-84a0-2ca1754c79d4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 00:50:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:03,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 00:50:03,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:03,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:50:06,107 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 00:50:06,107 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 00:50:06,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:50:06,586 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 00:50:06,666 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 00:50:08,057 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 29 treesize of output 17 [2023-11-29 00:50:08,082 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